alexa Maximum common subgraph isomorphism algorithms for the matching of chemical structures.
Bioinformatics & Systems Biology

Bioinformatics & Systems Biology

Journal of Computer Science & Systems Biology

Author(s): Raymond JW, Willett P

Abstract Share this page

Abstract The maximum common subgraph (MCS) problem has become increasingly important in those aspects of chemoinformatics that involve the matching of 2D or 3D chemical structures. This paper provides a classification and a review of the many MCS algorithms, both exact and approximate, that have been described in the literature, and makes recommendations regarding their applicability to typical chemoinformatics tasks.
This article was published in J Comput Aided Mol Des and referenced in Journal of Computer Science & Systems Biology

Relevant Expert PPTs

Relevant Speaker PPTs

Recommended Conferences

Relevant Topics

Peer Reviewed Journals
 
Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals
International Conferences 2017-18
 
Meet Inspiring Speakers and Experts at our 3000+ Global Annual Meetings

Contact Us

 
© 2008-2017 OMICS International - Open Access Publisher. Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version
adwords