alexa Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm.
Bioinformatics & Systems Biology

Bioinformatics & Systems Biology

Journal of Computer Science & Systems Biology

Author(s): Raymond JW, Gardiner EJ, Willett P

Abstract Share this page

Abstract Recently a method (RASCAL) for determining graph similarity using a maximum common edge subgraph algorithm has been proposed which has proven to be very efficient when used to calculate the relative similarity of chemical structures represented as graphs. This paper describes heuristics which simplify a RASCAL similarity calculation by taking advantage of certain properties specific to chemical graph representations of molecular structure. These heuristics are shown experimentally to increase the efficiency of the algorithm, especially at more distant values of chemical graph similarity.
This article was published in J Chem Inf Comput Sci 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