{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T22:32:15Z","timestamp":1773181935509,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Cheminform"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1186\/1758-2946-5-s1-o6","type":"journal-article","created":{"date-parts":[[2013,3,22]],"date-time":"2013-03-22T11:15:16Z","timestamp":1363950916000},"source":"Crossref","is-referenced-by-count":38,"title":["FMCS: a novel algorithm for the multiple MCS problem"],"prefix":"10.1186","volume":"5","author":[{"given":"Andrew","family":"Dalke","sequence":"first","affiliation":[]},{"given":"Janna","family":"Hastings","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,3,22]]},"reference":[{"key":"383_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.4380120103","volume":"12","author":"JJ McGregor","year":"1982","unstructured":"McGregor JJ: Backtrack Search Algorithms and the Maximal Common Subgraph Problem. Software-Practice and Experience. 1982, 12: 23-34. 10.1002\/spe.4380120103.","journal-title":"Software-Practice and Experience"},{"key":"383_CR2","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1023\/A:1021271615909","volume":"16","author":"JW Raymond","year":"2002","unstructured":"Raymond JW, Willett P: Maximum common subgraph isomorphism algorithms for the matching of chemical structures. J Comp Aid Mol Des. 2002, 16: 521-533. 10.1023\/A:1021271615909.","journal-title":"J Comp Aid Mol Des"},{"key":"383_CR3","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1021\/ci100297y","volume":"51","author":"R Hariharan","year":"2011","unstructured":"Hariharan R, Janakiraman A, Nilakantan R, Singh B, Varghese S, Landrum G, Schuffenhauer A: MultiMCS: A Fast Algorithm for the Maximum Common Substructure Problem on Multiple Molecules. J Chem Inf Mod. 2011, 51: 788-806. 10.1021\/ci100297y.","journal-title":"J Chem Inf Mod"},{"key":"383_CR4","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1021\/ci60018a014","volume":"19","author":"T Varkony","year":"1979","unstructured":"Varkony T, Shiloach Y, Smith D: Computer-Assisted Examination of Chemical Compounds for Structural Similarities. J Chem Inf Comp Sci. 1979, 19: 104-111. 10.1021\/ci60018a014.","journal-title":"J Chem Inf Comp Sci"},{"key":"383_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.2116\/analsci.3.23","volume":"3","author":"Y Takahashi","year":"1987","unstructured":"Takahashi Y, Satoh Y, Suzuki H, Sasaki S: Recognition of Largest Structural Fragment among a Variety of Chemical Structures. Anal Sci. 1987, 3: 23-28. 10.2116\/analsci.3.23.","journal-title":"Anal Sci"},{"key":"383_CR6","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1186\/1758-2946-1-12","volume":"1","author":"SA Rahman","year":"2009","unstructured":"Rahman SA, Holliday GL, Schrader R, Thornton JM: Small Molecule Subgraph Detector (SMSD) Toolkit. J Cheminf. 2009, 1: 12-10.1186\/1758-2946-1-12.","journal-title":"J Cheminf"},{"key":"383_CR7","unstructured":"Indigo cheminformatics library. [\n                    http:\/\/ggasoftware.com\/opensource\/indigo\/\n                    \n                  ]"},{"key":"383_CR8","unstructured":"RDKit cheminformatics library. [\n                    http:\/\/rdkit.org\/\n                    \n                  ]"},{"key":"383_CR9","doi-asserted-by":"publisher","first-page":"D344","DOI":"10.1093\/nar\/gkm791","volume":"36","author":"K Degtyarenko","year":"2008","unstructured":"Degtyarenko K, de Matos P, Ennis M, Hastings J, Zbinden M, McNaught A, Alc\u00e1ntara R, Darsow M, Guedj M, Ashburner M: ChEBI: a database and ontology for chemical entities of biological interest. Nucleic Acids Res. 2008, 36: D344-D350.","journal-title":"Nucleic Acids Res"}],"container-title":["Journal of Cheminformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1758-2946-5-S1-O6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1758-2946-5-S1-O6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1758-2946-5-S1-O6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T14:36:28Z","timestamp":1561386988000},"score":1,"resource":{"primary":{"URL":"https:\/\/jcheminf.biomedcentral.com\/articles\/10.1186\/1758-2946-5-S1-O6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":9,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["383"],"URL":"https:\/\/doi.org\/10.1186\/1758-2946-5-s1-o6","relation":{},"ISSN":["1758-2946"],"issn-type":[{"value":"1758-2946","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3]]},"article-number":"O6"}}