Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review
The intuitive description of small and large molecules using graphs has led to an increasing interest in the application of graph concepts for describing, analyzing, and comparing small molecules as well as proteins. Graph theory is a well‐studied field and many applications are present in various s...
Gespeichert in:
| Veröffentlicht in: | Wiley interdisciplinary reviews. Computational molecular science 2011-01, Vol.1 (1), p.68-79 |
|---|---|
| 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 | 79 |
|---|---|
| container_issue | 1 |
| container_start_page | 68 |
| container_title | Wiley interdisciplinary reviews. Computational molecular science |
| container_volume | 1 |
| creator | Ehrlich, Hans-Christian Rarey, Matthias |
| description | The intuitive description of small and large molecules using graphs has led to an increasing interest in the application of graph concepts for describing, analyzing, and comparing small molecules as well as proteins. Graph theory is a well‐studied field and many applications are present in various scientific disciplines. Recent literature describes a number of successful applications to biological problems. One of the most applied concepts aims at finding a maximal common subgraph (MCS) isomorphism between two graphs. We review exact MCS algorithms, especially designed for graphs obtained from small and large molecules, and give an overview of their successful applications. © 2011 John Wiley & Sons, Ltd. WIREs Comput Mol Sci 2011 1 68–79 DOI: 10.1002/wcms.5
This article is categorized under:
Structure and Mechanism > Molecular Structures
Computer and Information Science > Chemoinformatics
Computer and Information Science > Computer Algorithms and Programming |
| doi_str_mv | 10.1002/wcms.5 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2008332870</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2008332870</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3235-aeca45838cfff1a37af538c23801a32492017feb08bdba65167b53c3a9c7d1063</originalsourceid><addsrcrecordid>eNp10EtLxDAQB_AiCoqPzxAQBA9d82ib1JssugqrHtbXLUzTdDfaNDVpXffb26XizbnM_OHHDEwUnRA8IRjTi7WyYZLuRAeEp3mMhUh2_2ae7UfHIbzjoZKcUEYOovIevo3tLVLOWteg0BdLD-0KmeCs8-3KBIugXjpvupUNCJoSdSttPIK2rY2CzrgmINMg62qt-ho8CsroRulLBMjrL6PXR9FeBXXQx7_9MHq-uX6a3sbzx9nd9GoeK0ZZGoNWkKSCCVVVFQHGoUqHQJnAQ6JJTjHhlS6wKMoCspRkvEiZYpArXhKcscPodNzbevfZ69DJd9f7ZjgpKcaCMSo4HtTZqJR3IXhdydYbC34jCZbbJ8rtE2U6wPMRrk2tN_8o-Tq9X2xtPFoTOv39Z8F_yIwzPrCHmRQLmr8tXl7kjP0AbkSDDg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2008332870</pqid></control><display><type>article</type><title>Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review</title><source>Wiley Online Library Journals Frontfile Complete</source><creator>Ehrlich, Hans-Christian ; Rarey, Matthias</creator><creatorcontrib>Ehrlich, Hans-Christian ; Rarey, Matthias</creatorcontrib><description>The intuitive description of small and large molecules using graphs has led to an increasing interest in the application of graph concepts for describing, analyzing, and comparing small molecules as well as proteins. Graph theory is a well‐studied field and many applications are present in various scientific disciplines. Recent literature describes a number of successful applications to biological problems. One of the most applied concepts aims at finding a maximal common subgraph (MCS) isomorphism between two graphs. We review exact MCS algorithms, especially designed for graphs obtained from small and large molecules, and give an overview of their successful applications. © 2011 John Wiley & Sons, Ltd. WIREs Comput Mol Sci 2011 1 68–79 DOI: 10.1002/wcms.5
This article is categorized under:
Structure and Mechanism > Molecular Structures
Computer and Information Science > Chemoinformatics
Computer and Information Science > Computer Algorithms and Programming</description><identifier>ISSN: 1759-0876</identifier><identifier>EISSN: 1759-0884</identifier><identifier>DOI: 10.1002/wcms.5</identifier><language>eng</language><publisher>Hoboken, USA: John Wiley & Sons, Inc</publisher><subject>Algorithms ; Graph theory ; Graphs ; Information science ; Isomorphism ; Molecular structure ; Proteins</subject><ispartof>Wiley interdisciplinary reviews. Computational molecular science, 2011-01, Vol.1 (1), p.68-79</ispartof><rights>Copyright © 2011 John Wiley & Sons, Ltd.</rights><rights>Copyright Wiley Subscription Services, Inc. Jan/Feb 2011</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3235-aeca45838cfff1a37af538c23801a32492017feb08bdba65167b53c3a9c7d1063</citedby><cites>FETCH-LOGICAL-c3235-aeca45838cfff1a37af538c23801a32492017feb08bdba65167b53c3a9c7d1063</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fwcms.5$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fwcms.5$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1411,27901,27902,45550,45551</link.rule.ids></links><search><creatorcontrib>Ehrlich, Hans-Christian</creatorcontrib><creatorcontrib>Rarey, Matthias</creatorcontrib><title>Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review</title><title>Wiley interdisciplinary reviews. Computational molecular science</title><addtitle>WIREs Comput Mol Sci</addtitle><description>The intuitive description of small and large molecules using graphs has led to an increasing interest in the application of graph concepts for describing, analyzing, and comparing small molecules as well as proteins. Graph theory is a well‐studied field and many applications are present in various scientific disciplines. Recent literature describes a number of successful applications to biological problems. One of the most applied concepts aims at finding a maximal common subgraph (MCS) isomorphism between two graphs. We review exact MCS algorithms, especially designed for graphs obtained from small and large molecules, and give an overview of their successful applications. © 2011 John Wiley & Sons, Ltd. WIREs Comput Mol Sci 2011 1 68–79 DOI: 10.1002/wcms.5
This article is categorized under:
Structure and Mechanism > Molecular Structures
Computer and Information Science > Chemoinformatics
Computer and Information Science > Computer Algorithms and Programming</description><subject>Algorithms</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Information science</subject><subject>Isomorphism</subject><subject>Molecular structure</subject><subject>Proteins</subject><issn>1759-0876</issn><issn>1759-0884</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><recordid>eNp10EtLxDAQB_AiCoqPzxAQBA9d82ib1JssugqrHtbXLUzTdDfaNDVpXffb26XizbnM_OHHDEwUnRA8IRjTi7WyYZLuRAeEp3mMhUh2_2ae7UfHIbzjoZKcUEYOovIevo3tLVLOWteg0BdLD-0KmeCs8-3KBIugXjpvupUNCJoSdSttPIK2rY2CzrgmINMg62qt-ho8CsroRulLBMjrL6PXR9FeBXXQx7_9MHq-uX6a3sbzx9nd9GoeK0ZZGoNWkKSCCVVVFQHGoUqHQJnAQ6JJTjHhlS6wKMoCspRkvEiZYpArXhKcscPodNzbevfZ69DJd9f7ZjgpKcaCMSo4HtTZqJR3IXhdydYbC34jCZbbJ8rtE2U6wPMRrk2tN_8o-Tq9X2xtPFoTOv39Z8F_yIwzPrCHmRQLmr8tXl7kjP0AbkSDDg</recordid><startdate>201101</startdate><enddate>201101</enddate><creator>Ehrlich, Hans-Christian</creator><creator>Rarey, Matthias</creator><general>John Wiley & Sons, Inc</general><general>Wiley Subscription Services, Inc</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7QH</scope><scope>7TN</scope><scope>7UA</scope><scope>C1K</scope><scope>F1W</scope><scope>H96</scope><scope>JQ2</scope><scope>L.G</scope></search><sort><creationdate>201101</creationdate><title>Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review</title><author>Ehrlich, Hans-Christian ; Rarey, Matthias</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3235-aeca45838cfff1a37af538c23801a32492017feb08bdba65167b53c3a9c7d1063</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithms</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Information science</topic><topic>Isomorphism</topic><topic>Molecular structure</topic><topic>Proteins</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ehrlich, Hans-Christian</creatorcontrib><creatorcontrib>Rarey, Matthias</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Aqualine</collection><collection>Oceanic Abstracts</collection><collection>Water Resources Abstracts</collection><collection>Environmental Sciences and Pollution Management</collection><collection>ASFA: Aquatic Sciences and Fisheries Abstracts</collection><collection>Aquatic Science & Fisheries Abstracts (ASFA) 2: Ocean Technology, Policy & Non-Living Resources</collection><collection>ProQuest Computer Science Collection</collection><collection>Aquatic Science & Fisheries Abstracts (ASFA) Professional</collection><jtitle>Wiley interdisciplinary reviews. Computational molecular science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ehrlich, Hans-Christian</au><au>Rarey, Matthias</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review</atitle><jtitle>Wiley interdisciplinary reviews. Computational molecular science</jtitle><addtitle>WIREs Comput Mol Sci</addtitle><date>2011-01</date><risdate>2011</risdate><volume>1</volume><issue>1</issue><spage>68</spage><epage>79</epage><pages>68-79</pages><issn>1759-0876</issn><eissn>1759-0884</eissn><abstract>The intuitive description of small and large molecules using graphs has led to an increasing interest in the application of graph concepts for describing, analyzing, and comparing small molecules as well as proteins. Graph theory is a well‐studied field and many applications are present in various scientific disciplines. Recent literature describes a number of successful applications to biological problems. One of the most applied concepts aims at finding a maximal common subgraph (MCS) isomorphism between two graphs. We review exact MCS algorithms, especially designed for graphs obtained from small and large molecules, and give an overview of their successful applications. © 2011 John Wiley & Sons, Ltd. WIREs Comput Mol Sci 2011 1 68–79 DOI: 10.1002/wcms.5
This article is categorized under:
Structure and Mechanism > Molecular Structures
Computer and Information Science > Chemoinformatics
Computer and Information Science > Computer Algorithms and Programming</abstract><cop>Hoboken, USA</cop><pub>John Wiley & Sons, Inc</pub><doi>10.1002/wcms.5</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1759-0876 |
| ispartof | Wiley interdisciplinary reviews. Computational molecular science, 2011-01, Vol.1 (1), p.68-79 |
| issn | 1759-0876 1759-0884 |
| language | eng |
| recordid | cdi_proquest_journals_2008332870 |
| source | Wiley Online Library Journals Frontfile Complete |
| subjects | Algorithms Graph theory Graphs Information science Isomorphism Molecular structure Proteins |
| title | Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T19%3A37%3A41IST&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=Maximum%20common%20subgraph%20isomorphism%20algorithms%20and%20their%20applications%20in%20molecular%20science:%20a%20review&rft.jtitle=Wiley%20interdisciplinary%20reviews.%20Computational%20molecular%20science&rft.au=Ehrlich,%20Hans-Christian&rft.date=2011-01&rft.volume=1&rft.issue=1&rft.spage=68&rft.epage=79&rft.pages=68-79&rft.issn=1759-0876&rft.eissn=1759-0884&rft_id=info:doi/10.1002/wcms.5&rft_dat=%3Cproquest_cross%3E2008332870%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=2008332870&rft_id=info:pmid/&rfr_iscdi=true |