A fast discovery algorithm for large common connected induced subgraphs
We present a fast algorithm for the classical problem of finding common subgraphs, which are useful for detecting structural relationships between biological macromolecules. Although the cost is potentially high for this hard problem, we improve performance by several orders of magnitude compared to...
Gespeichert in:
| Veröffentlicht in: | Discrete Applied Mathematics 2019-09, Vol.268, p.210-222 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 222 |
|---|---|
| container_issue | |
| container_start_page | 210 |
| container_title | Discrete Applied Mathematics |
| container_volume | 268 |
| creator | Conte, Alessio Grossi, Roberto Marino, Andrea Tattini, Lorenzo Versari, Luca |
| description | We present a fast algorithm for the classical problem of finding common subgraphs, which are useful for detecting structural relationships between biological macromolecules. Although the cost is potentially high for this hard problem, we improve performance by several orders of magnitude compared to known algorithms. We validate our findings with experiments on proteins with thousands of atoms. |
| doi_str_mv | 10.1016/j.dam.2019.02.023 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2305518245</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0166218X19301064</els_id><sourcerecordid>2305518245</sourcerecordid><originalsourceid>FETCH-LOGICAL-c368t-edfc0b3582de4c4d64690c9f40889d65987a0be77083e3b80e1f07b2be812a2c3</originalsourceid><addsrcrecordid>eNp9UE1LAzEUDKJgrf4Abwued31J9iOLp1K0FQpeFLyFbPK2zdLd1GS30H9vSj0LA8ODmffeDCGPFDIKtHzuMqP6jAGtM2AR_IrMqKhYWlYVvSazqClTRsX3LbkLoQMAGqcZWS2SVoUxMTZod0R_StR-67wdd33SOp_sld9iol3fuyHSMKAe0SR2MJOOHKZm69VhF-7JTav2AR_-eE6-3l4_l-t087F6Xy42qealGFM0rYaGF4IZzHVuyrysQddtDkLUpixqUSlosKpAcOSNAKQtVA1rUFCmmOZz8nTZe_DuZ8Iwys5NfognJeNQFFSwvIgqelFp70Lw2MqDt73yJ0lBnvuSnYx9yXNfElgEj56Xiwfj-0eLXgZtcYgprY-hpXH2H_cvuKJyvg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2305518245</pqid></control><display><type>article</type><title>A fast discovery algorithm for large common connected induced subgraphs</title><source>Access via ScienceDirect (Elsevier)</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Conte, Alessio ; Grossi, Roberto ; Marino, Andrea ; Tattini, Lorenzo ; Versari, Luca</creator><creatorcontrib>Conte, Alessio ; Grossi, Roberto ; Marino, Andrea ; Tattini, Lorenzo ; Versari, Luca</creatorcontrib><description>We present a fast algorithm for the classical problem of finding common subgraphs, which are useful for detecting structural relationships between biological macromolecules. Although the cost is potentially high for this hard problem, we improve performance by several orders of magnitude compared to known algorithms. We validate our findings with experiments on proteins with thousands of atoms.</description><identifier>ISSN: 0166-218X</identifier><identifier>EISSN: 1872-6771</identifier><identifier>DOI: 10.1016/j.dam.2019.02.023</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithms ; Enumeration ; Graph theory ; Isomorphisms ; Macromolecules ; Maximal common subgraphs ; Output sensitive ; Performance enhancement</subject><ispartof>Discrete Applied Mathematics, 2019-09, Vol.268, p.210-222</ispartof><rights>2019 Elsevier B.V.</rights><rights>Copyright Elsevier BV Sep 15, 2019</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c368t-edfc0b3582de4c4d64690c9f40889d65987a0be77083e3b80e1f07b2be812a2c3</citedby><cites>FETCH-LOGICAL-c368t-edfc0b3582de4c4d64690c9f40889d65987a0be77083e3b80e1f07b2be812a2c3</cites><orcidid>0000-0002-5477-084X ; 0000-0003-3495-1325 ; 0000-0003-0770-2235</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.dam.2019.02.023$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Conte, Alessio</creatorcontrib><creatorcontrib>Grossi, Roberto</creatorcontrib><creatorcontrib>Marino, Andrea</creatorcontrib><creatorcontrib>Tattini, Lorenzo</creatorcontrib><creatorcontrib>Versari, Luca</creatorcontrib><title>A fast discovery algorithm for large common connected induced subgraphs</title><title>Discrete Applied Mathematics</title><description>We present a fast algorithm for the classical problem of finding common subgraphs, which are useful for detecting structural relationships between biological macromolecules. Although the cost is potentially high for this hard problem, we improve performance by several orders of magnitude compared to known algorithms. We validate our findings with experiments on proteins with thousands of atoms.</description><subject>Algorithms</subject><subject>Enumeration</subject><subject>Graph theory</subject><subject>Isomorphisms</subject><subject>Macromolecules</subject><subject>Maximal common subgraphs</subject><subject>Output sensitive</subject><subject>Performance enhancement</subject><issn>0166-218X</issn><issn>1872-6771</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp9UE1LAzEUDKJgrf4Abwued31J9iOLp1K0FQpeFLyFbPK2zdLd1GS30H9vSj0LA8ODmffeDCGPFDIKtHzuMqP6jAGtM2AR_IrMqKhYWlYVvSazqClTRsX3LbkLoQMAGqcZWS2SVoUxMTZod0R_StR-67wdd33SOp_sld9iol3fuyHSMKAe0SR2MJOOHKZm69VhF-7JTav2AR_-eE6-3l4_l-t087F6Xy42qealGFM0rYaGF4IZzHVuyrysQddtDkLUpixqUSlosKpAcOSNAKQtVA1rUFCmmOZz8nTZe_DuZ8Iwys5NfognJeNQFFSwvIgqelFp70Lw2MqDt73yJ0lBnvuSnYx9yXNfElgEj56Xiwfj-0eLXgZtcYgprY-hpXH2H_cvuKJyvg</recordid><startdate>20190915</startdate><enddate>20190915</enddate><creator>Conte, Alessio</creator><creator>Grossi, Roberto</creator><creator>Marino, Andrea</creator><creator>Tattini, Lorenzo</creator><creator>Versari, Luca</creator><general>Elsevier B.V</general><general>Elsevier BV</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-5477-084X</orcidid><orcidid>https://orcid.org/0000-0003-3495-1325</orcidid><orcidid>https://orcid.org/0000-0003-0770-2235</orcidid></search><sort><creationdate>20190915</creationdate><title>A fast discovery algorithm for large common connected induced subgraphs</title><author>Conte, Alessio ; Grossi, Roberto ; Marino, Andrea ; Tattini, Lorenzo ; Versari, Luca</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c368t-edfc0b3582de4c4d64690c9f40889d65987a0be77083e3b80e1f07b2be812a2c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Enumeration</topic><topic>Graph theory</topic><topic>Isomorphisms</topic><topic>Macromolecules</topic><topic>Maximal common subgraphs</topic><topic>Output sensitive</topic><topic>Performance enhancement</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Conte, Alessio</creatorcontrib><creatorcontrib>Grossi, Roberto</creatorcontrib><creatorcontrib>Marino, Andrea</creatorcontrib><creatorcontrib>Tattini, Lorenzo</creatorcontrib><creatorcontrib>Versari, Luca</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Discrete Applied Mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Conte, Alessio</au><au>Grossi, Roberto</au><au>Marino, Andrea</au><au>Tattini, Lorenzo</au><au>Versari, Luca</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A fast discovery algorithm for large common connected induced subgraphs</atitle><jtitle>Discrete Applied Mathematics</jtitle><date>2019-09-15</date><risdate>2019</risdate><volume>268</volume><spage>210</spage><epage>222</epage><pages>210-222</pages><issn>0166-218X</issn><eissn>1872-6771</eissn><abstract>We present a fast algorithm for the classical problem of finding common subgraphs, which are useful for detecting structural relationships between biological macromolecules. Although the cost is potentially high for this hard problem, we improve performance by several orders of magnitude compared to known algorithms. We validate our findings with experiments on proteins with thousands of atoms.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.dam.2019.02.023</doi><tpages>13</tpages><orcidid>https://orcid.org/0000-0002-5477-084X</orcidid><orcidid>https://orcid.org/0000-0003-3495-1325</orcidid><orcidid>https://orcid.org/0000-0003-0770-2235</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0166-218X |
| ispartof | Discrete Applied Mathematics, 2019-09, Vol.268, p.210-222 |
| issn | 0166-218X 1872-6771 |
| language | eng |
| recordid | cdi_proquest_journals_2305518245 |
| source | Access via ScienceDirect (Elsevier); EZB-FREE-00999 freely available EZB journals |
| subjects | Algorithms Enumeration Graph theory Isomorphisms Macromolecules Maximal common subgraphs Output sensitive Performance enhancement |
| title | A fast discovery algorithm for large common connected induced subgraphs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T18%3A36%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20fast%20discovery%20algorithm%20for%20large%20common%20connected%20induced%20subgraphs&rft.jtitle=Discrete%20Applied%20Mathematics&rft.au=Conte,%20Alessio&rft.date=2019-09-15&rft.volume=268&rft.spage=210&rft.epage=222&rft.pages=210-222&rft.issn=0166-218X&rft.eissn=1872-6771&rft_id=info:doi/10.1016/j.dam.2019.02.023&rft_dat=%3Cproquest_cross%3E2305518245%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2305518245&rft_id=info:pmid/&rft_els_id=S0166218X19301064&rfr_iscdi=true |