{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:42:58Z","timestamp":1760708578068,"version":"build-2065373602"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:00:00Z","timestamp":1760659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:sec>\n            <jats:title>Background<\/jats:title>\n            <jats:p>There is a need for computational approaches to compare small organic molecules based on chemical similarity or for evaluating biochemical transformations. No tool currently exists to generate global molecular alignments for small organic molecules. The study introduces a new approach to molecular alignment in the Simplified Molecular Input Line Entry System (SMILES) format. This method leverages programming and scoring alignments to minimize differences in electronegativity, here using a measure of atomic partial charges to address the challenge of understanding structural transformations in reaction pathways. This can be applied to study transitions from linear to cyclical pathways.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Results<\/jats:title>\n            <jats:p>The proposed method is based on the Needleman-Wunsch algorithm for sequence alignment, but it uses a modified scoring function for different input data. Validation against a benchmarked dataset from the Krebs cycle, based on the known chemical transformations in the pathway, confirmed the efficacy of the approach in aligning atoms that are known to be the same across the transformation. The algorithm also quantified each transformation of metabolites in the Pentose Phosphate Pathway and in Glycolysis. The method was used to study the difference in chemical similarity over transformations between linear and cyclical pathways. The study found a midpoint dissimilarity peak in cyclical pathways (particularly the Krebs Cycle) and a progressive decrease in molecular similarity in linear pathways, consistent with expectations.<\/jats:p>\n          <\/jats:sec>\n          <jats:sec>\n            <jats:title>Conclusions<\/jats:title>\n            <jats:p>The study introduces an algorithm that quantifies molecular transformations in metabolic pathways. The algorithm effectively highlights structural changes and was applied to a hypothesis about the transition from linear to cyclical structures. The software, which provides valuable insights into molecular transformations, is available at: <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" xlink:href=\"https:\/\/github.com\/24atang\/SMILES-Alignment.git\" ext-link-type=\"uri\">https:\/\/github.com\/24atang\/SMILES-Alignment.git<\/jats:ext-link>\n            <\/jats:p>\n          <\/jats:sec>","DOI":"10.1186\/s12859-025-06278-y","type":"journal-article","created":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:08:10Z","timestamp":1760706490000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SMILES alignment: a dynamic programming approach for the alignment of metabolites and other small organic molecules"],"prefix":"10.1186","volume":"26","author":[{"given":"Alexis L.","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David A.","family":"Liberles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,17]]},"reference":[{"issue":"6","key":"6278_CR1","doi-asserted-by":"publisher","first-page":"2230","DOI":"10.1021\/ci060016u","volume":"46","author":"WL Chen","year":"2006","unstructured":"Chen WL. Chemoinformatics: past, present, and future. J Chem Inf Model. 2006;46(6):2230\u201355. https:\/\/doi.org\/10.1021\/ci060016u.","journal-title":"J Chem Inf Model"},{"key":"6278_CR2","unstructured":"Landrum G. RDKit: Open-Source Cheminformatics Software. Available from: http:\/\/www.rdkit.org Accessed Jul 15, 2023. mut"},{"issue":"1","key":"6278_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1186\/1758-2946-3-33","volume":"3","author":"NM O\u2019Boyle","year":"2011","unstructured":"O\u2019Boyle NM, Banck M, James CA, Morley C, Vandermeersch T, Hutchison GR. Open babel: an open chemical toolbox. J Cheminformatics. 2011;3(1):33. https:\/\/doi.org\/10.1186\/1758-2946-3-33.","journal-title":"J Cheminformatics"},{"issue":"23\u201324","key":"6278_CR4","doi-asserted-by":"publisher","first-page":"1046","DOI":"10.1016\/j.drudis.2006.10.005","volume":"11","author":"P Willett","year":"2006","unstructured":"Willett P. Similarity-based virtual screening using 2D fingerprints. Drug Discov Today. 2006;11(23\u201324):1046\u201353. https:\/\/doi.org\/10.1016\/j.drudis.2006.10.005.","journal-title":"Drug Discov Today"},{"key":"6278_CR5","doi-asserted-by":"publisher","unstructured":"Hernandez M, Zaribafiyan A, Aramon M, Naghibi M. A Novel Graph-Based Approach for Determining Molecular Similarity. 2016. https:\/\/doi.org\/10.48550\/ARXIV.1601.06693.","DOI":"10.48550\/ARXIV.1601.06693"},{"issue":"7","key":"6278_CR6","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 Comput Aided Mol Des. 2002;16(7):521\u201333. https:\/\/doi.org\/10.1023\/A:1021271615909.","journal-title":"J Comput Aided Mol Des"},{"issue":"11","key":"6278_CR7","doi-asserted-by":"publisher","first-page":"6670","DOI":"10.1021\/acs.jctc.2c00718","volume":"18","author":"S Gugler","year":"2022","unstructured":"Gugler S, Reiher M. Quantum chemical roots of machine-learning molecular similarity descriptors. J Chem Theory Comput. 2022;18(11):6670\u201389. https:\/\/doi.org\/10.1021\/acs.jctc.2c00718.","journal-title":"J Chem Theory Comput"},{"issue":"24","key":"6278_CR8","doi-asserted-by":"publisher","first-page":"241722","DOI":"10.1063\/1.5019779","volume":"148","author":"KT Sch\u00fctt","year":"2018","unstructured":"Sch\u00fctt KT, Sauceda HE, Kindermans PJ, Tkatchenko A, M\u00fcller KR. SchNet \u2013 a deep learning architecture for molecules and materials. J Chem Phys. 2018;148(24):241722. https:\/\/doi.org\/10.1063\/1.5019779.","journal-title":"J Chem Phys"},{"issue":"Suppl 4","key":"6278_CR9","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1186\/s12859-022-04667-1","volume":"23","author":"H Hadipour","year":"2022","unstructured":"Hadipour H, Liu C, Davis R, et al. Deep clustering of small molecules at large-scale via variational autoencoder embedding and K-means. BMC Bioinformatics. 2022;23(Suppl 4):132. https:\/\/doi.org\/10.1186\/s12859-022-04667-1.","journal-title":"BMC Bioinformatics"},{"issue":"S15","key":"6278_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1186\/s12859-019-3118-5","volume":"20","author":"NC Chung","year":"2019","unstructured":"Chung NC, Miasojedow B, Startek M, Gambin A. Jaccard\/tanimoto similarity test and estimation methods for biological presence-absence data. BMC Bioinformatics. 2019;20(S15):644. https:\/\/doi.org\/10.1186\/s12859-019-3118-5.","journal-title":"BMC Bioinformatics"},{"issue":"6","key":"6278_CR11","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1021\/ci9800211","volume":"38","author":"P Willett","year":"1998","unstructured":"Willett P, Barnard JM, Downs GM. Chemical similarity searching. J Chem Inf Comput Sci. 1998;38(6):983\u201396. https:\/\/doi.org\/10.1021\/ci9800211.","journal-title":"J Chem Inf Comput Sci"},{"issue":"22","key":"6278_CR12","doi-asserted-by":"publisher","first-page":"3204","DOI":"10.1039\/b409813g","volume":"2","author":"A Bender","year":"2004","unstructured":"Bender A, Glen RC. Molecular similarity: a key technique in molecular informatics. Org Biomol Chem. 2004;2(22):3204. https:\/\/doi.org\/10.1039\/b409813g.","journal-title":"Org Biomol Chem"},{"issue":"3\u20134","key":"6278_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A Ben-Dor","year":"1999","unstructured":"Ben-Dor A, Shamir R, Yakhini Z. Clustering gene expression patterns. J Comput Biol. 1999;6(3\u20134):281\u201397. https:\/\/doi.org\/10.1089\/106652799318274.","journal-title":"J Comput Biol"},{"issue":"11","key":"6278_CR14","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1109\/t-c.1973.223640","volume":"C-22","author":"RA Jarvis","year":"1973","unstructured":"Jarvis RA, Patrick EA. Clustering using a similarity measure based on shared near neighbors. IEEE Trans Comput. 1973;C\u201322(11):1025\u201334. https:\/\/doi.org\/10.1109\/t-c.1973.223640.","journal-title":"IEEE Trans Comput"},{"issue":"5","key":"6278_CR15","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/s1093-3263(02)00188-2","volume":"21","author":"JW Raymond","year":"2003","unstructured":"Raymond JW, Blankley CJ, Willett P. Comparison of chemical clustering methods using graph- and fingerprint-based similarity measures. J Mol Graph Model. 2003;21(5):421\u201333. https:\/\/doi.org\/10.1016\/s1093-3263(02)00188-2.","journal-title":"J Mol Graph Model"},{"issue":"301","key":"6278_CR16","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1080\/01621459.1963.10500845.17","volume":"58","author":"JH Ward","year":"1963","unstructured":"Ward JH. Hierarchical Grouping to optimize an objective function. J Am Stat Assoc. 1963;58(301):236\u201344. https:\/\/doi.org\/10.1080\/01621459.1963.10500845.17.","journal-title":"J Am Stat Assoc"},{"issue":"13","key":"6278_CR17","doi-asserted-by":"publisher","first-page":"4358","DOI":"10.1021\/jm040213p","volume":"48","author":"M Stahl","year":"2005","unstructured":"Stahl M, Mauser H, Tsui M, Taylor NR. A robust clustering method for chemical structures. J Med Chem. 2005;48(13):4358\u201366.","journal-title":"J Med Chem"},{"issue":"12","key":"6278_CR18","doi-asserted-by":"publisher","first-page":"2987","DOI":"10.1021\/acs.jcim.2c00265","volume":"62","author":"DN Prada","year":"2022","unstructured":"Prada DN, Llanos MA, Bellera CL, Talevi A, Alberca LN. iRaPCA and SOMoC: development and validation of web applications for new approaches for the clustering of small molecules. J Chem Inf Model. 2022;62(12):2987\u201398. https:\/\/doi.org\/10.1021\/acs.jcim.2c00265.","journal-title":"J Chem Inf Model"},{"issue":"12","key":"6278_CR19","doi-asserted-by":"publisher","first-page":"3302","DOI":"10.1021\/ci500480b","volume":"54","author":"S Gan","year":"2014","unstructured":"Gan S, Cosgrove DA, Gardiner EJ, Gillet VJ. Investigation of the use of spectral clustering for the analysis of molecular data. J Chem Inf Model. 2014;54(12):3302\u201319. https:\/\/doi.org\/10.1021\/ci500480b.","journal-title":"J Chem Inf Model"},{"issue":"1","key":"6278_CR20","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1186\/s13321-015-0056-8","volume":"7","author":"A Gobbi","year":"2015","unstructured":"Gobbi A, Giannetti AM, Chen H, Lee ML. Atom-atom-path similarity and sphere exclusion clustering: tools for prioritizing fragment hits. J Cheminform. 2015;7(1):11.","journal-title":"J Cheminform"},{"issue":"3","key":"6278_CR21","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1093\/bioinformatics\/18.3.452","volume":"18","author":"C Lee","year":"2002","unstructured":"Lee C, Grasso C, Sharlow MF. Multiple sequence alignment using partial order graphs. Bioinformatics. 2002;18(3):452\u201364. https:\/\/doi.org\/10.1093\/bioinformatics\/18.3.452.","journal-title":"Bioinformatics"},{"issue":"22","key":"6278_CR22","doi-asserted-by":"publisher","first-page":"3219","DOI":"10.1016\/0040-4020(80)80168-2","volume":"36","author":"J Gasteiger","year":"1980","unstructured":"Gasteiger J, Marsili M. Iterative partial equalization of orbital electronegativity: a rapid access to atomic charges. Tetrahedron. 1980;36(22):3219\u201328. https:\/\/doi.org\/10.1016\/0040-4020(80)80168-2.","journal-title":"Tetrahedron"},{"issue":"25","key":"6278_CR23","doi-asserted-by":"publisher","first-page":"10024","DOI":"10.1021\/ja000512040","volume":"114","author":"AK Rappe","year":"1992","unstructured":"Rappe AK, Casewit CJ, Colwell KS, Goddard WA, Skiff WM. UFF, a full periodic table force field for molecular mechanics and molecular dynamics simulations. J Am Chem Soc. 1992;114(25):10024\u201335. https:\/\/doi.org\/10.1021\/ja000512040.","journal-title":"J Am Chem Soc"},{"issue":"3","key":"6278_CR24","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","volume":"48","author":"SB Needleman","year":"1970","unstructured":"Needleman SB, Wunsch CD. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J Mol Biol. 1970;48(3):443\u201353. https:\/\/doi.org\/10.1016\/0022-2836(70)90057-4.","journal-title":"J Mol Biol"},{"issue":"22","key":"6278_CR25","doi-asserted-by":"publisher","first-page":"10915","DOI":"10.1073\/pnas.89.22.10915","volume":"89","author":"S Henikoff","year":"1992","unstructured":"Henikoff S, Henikoff JG. Amino acid substitution matrices from protein blocks. Proc Natl Acad Sci U S A. 1992;89(22):10915\u20139. https:\/\/doi.org\/10.1073\/pnas.89.22.10915.","journal-title":"Proc Natl Acad Sci U S A"},{"issue":"D1","key":"6278_CR26","doi-asserted-by":"publisher","first-page":"D1373","DOI":"10.1093\/nar\/gkac956","volume":"51","author":"S Kim","year":"2023","unstructured":"Kim S, Chen J, Cheng T, Gindulyte A, He J, He S, et al. PubChem 2023 Update. Nucleic Acids Res. 2023;51(D1):D1373\u201380. https:\/\/doi.org\/10.1093\/nar\/gkac956.","journal-title":"Nucleic Acids Res"},{"issue":"S1","key":"6278_CR27","doi-asserted-by":"publisher","first-page":"P4","DOI":"10.1186\/1758-2946-3-S1-P4","volume":"3","author":"D Pavlov","year":"2011","unstructured":"Pavlov D, Rybalkin M, Karulin B, Kozhevnikov M, Savelyev A, Churinov A. Indigo: universal cheminformatics API. J Cheminform. 2011;3(S1):P4. https:\/\/doi.org\/10.1186\/1758-2946-3-S1-P4.","journal-title":"J Cheminform"},{"key":"6278_CR28","first-page":"513","volume-title":"In Karp\u2019s Cell and Molecular Biology: Concepts and Experiments","author":"J Iwasa","year":"2020","unstructured":"Iwasa J, Marshall WF, Karp G. In Karp\u2019s Cell and Molecular Biology: Concepts and Experiments. Hoboken: Wiley; 2020. p. 513."},{"issue":"1","key":"6278_CR29","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1186\/1471-2105-5-15","volume":"5","author":"S Light","year":"2004","unstructured":"Light S, Kraulis P. Network analysis of metabolic enzyme evolution in escherichia coli. BMC Bioinform. 2004;5(1):15. https:\/\/doi.org\/10.1186\/1471-2105-5-15.","journal-title":"BMC Bioinform"},{"issue":"4","key":"6278_CR30","first-page":"845","volume":"163","author":"VI Levenshtein","year":"1965","unstructured":"Levenshtein VI. Binary codes capable of correcting deletions, insertions, and reversals. Dokl Akad Nauk. 1965;163(4):845\u20138.","journal-title":"Dokl Akad Nauk"},{"issue":"1","key":"6278_CR31","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1146\/annurev.mi.30.100176.002205","volume":"30","author":"RA Jensen","year":"1976","unstructured":"Jensen RA. Enzyme recruitment in evolution of new function. Annu Rev Microbiol. 1976;30(1):409\u201325. https:\/\/doi.org\/10.1146\/annurev.mi.30.100176.002205.","journal-title":"Annu Rev Microbiol"},{"key":"6278_CR32","unstructured":"Nelson DL, Cox MM. Lehninger Principles of Biochemistry. In: Lehninger Principles of Biochemistry. New York: W.H. Freeman, Macmillan Learning; 2017. p. 1530\u20131."},{"issue":"D1","key":"6278_CR33","doi-asserted-by":"publisher","first-page":"D587","DOI":"10.1093\/nar\/gkac963","volume":"51","author":"M Kanehisa","year":"2023","unstructured":"Kanehisa M, Furumichi M, Sato Y, Kawashima M, Ishiguro-Watanabe M. KEGG for taxonomy-based analysis of pathways and genomes. Nucleic Acids Res. 2023;51(D1):D587\u201392. https:\/\/doi.org\/10.1093\/nar\/gkac963.","journal-title":"Nucleic Acids Res"},{"issue":"6","key":"6278_CR34","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1073\/pnas.31.6.153","volume":"31","author":"NH Horowitz","year":"1945","unstructured":"Horowitz NH. On the evolution of biochemical syntheses. Proc Natl Acad Sci U S A. 1945;31(6):153\u20137. https:\/\/doi.org\/10.1073\/pnas.31.6.153.","journal-title":"Proc Natl Acad Sci U S A"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-025-06278-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s12859-025-06278-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-025-06278-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:08:13Z","timestamp":1760706493000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-025-06278-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,17]]},"references-count":34,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["6278"],"URL":"https:\/\/doi.org\/10.1186\/s12859-025-06278-y","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,17]]},"assertion":[{"value":"3 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"251"}}