{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:28:31Z","timestamp":1740144511717,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","funder":[{"name":"VW Stiftung","award":["VWZN3157"],"award-info":[{"award-number":["VWZN3157"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1186\/s13015-017-0118-8","type":"journal-article","created":{"date-parts":[[2017,12,11]],"date-time":"2017-12-11T03:41:02Z","timestamp":1512963662000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Phylogeny reconstruction based on the length distribution of k-mismatch common substrings"],"prefix":"10.1186","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7431-2862","authenticated-orcid":false,"given":"Burkhard","family":"Morgenstern","sequence":"first","affiliation":[]},{"given":"Svenja","family":"Sch\u00f6bel","sequence":"additional","affiliation":[]},{"given":"Chris-Andr\u00e9","family":"Leimeister","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,11]]},"reference":[{"key":"118_CR1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1093\/bib\/bbu005","volume":"15","author":"S Vinga","year":"2014","unstructured":"Vinga S. Editorial: Alignment-free methods in computational biology. Brief Bioinform. 2014;15:341\u20132.","journal-title":"Brief Bioinform"},{"key":"118_CR2","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1177\/117693430600200016","volume":"2","author":"M H\u00f6hl","year":"2006","unstructured":"H\u00f6hl M, Rigoutsos I, Ragan MA. Pattern-based phylogenetic distance estimation and tree reconstruction. Evol Bioinform Online. 2006;2:359\u201375.","journal-title":"Evol Bioinform Online"},{"key":"118_CR3","doi-asserted-by":"crossref","first-page":"2677","DOI":"10.1073\/pnas.0813249106","volume":"106","author":"GE Sims","year":"2009","unstructured":"Sims GE, Jun S-R, Wu GA, Kim S-H. Alignment-free genome comparison with feature frequency profiles (FFP) and optimal resolutions. Proc Natl Acad Sci USA. 2009;106:2677\u201382.","journal-title":"Proc Natl Acad Sci USA"},{"key":"118_CR4","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1186\/gb-2009-10-10-r108","volume":"10","author":"B Chor","year":"2009","unstructured":"Chor B, Horn D, Levy Y, Goldman N, Massingham T. Genomic DNA $$k$$ k -mer spectra: models and modalities. Genome Biol. 2009;10:108.","journal-title":"Genome Biol"},{"key":"118_CR5","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1186\/1748-7188-7-10","volume":"7","author":"S Vinga","year":"2012","unstructured":"Vinga S, Carvalho AM, Francisco AP, Russo LMS, Almeida JS. Pattern matching through Chaos Game Representation: bridging numerical and discrete data structures for biological sequence analysis. Algorithms Mol Biol. 2012;7:10.","journal-title":"Algorithms Mol Biol"},{"key":"118_CR6","doi-asserted-by":"crossref","first-page":"1991","DOI":"10.1093\/bioinformatics\/btu177","volume":"30","author":"C-A Leimeister","year":"2014","unstructured":"Leimeister C-A, Boden M, Horwege S, Lindner S, Morgenstern B. Fast alignment-free sequence comparison using spaced-word frequencies. Bioinformatics. 2014;30:1991\u20139.","journal-title":"Bioinformatics"},{"key":"118_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1186\/s13015-015-0032-x","volume":"10","author":"B Morgenstern","year":"2015","unstructured":"Morgenstern B, Zhu B, Horwege S, Leimeister C-A. Estimating evolutionary distances between genomic sequences from spaced-word matches. Algorithms Mol Biol. 2015;10:5.","journal-title":"Algorithms Mol Biol"},{"issue":"10","key":"118_CR8","doi-asserted-by":"crossref","first-page":"1005107","DOI":"10.1371\/journal.pcbi.1005107","volume":"12","author":"L Hahn","year":"2016","unstructured":"Hahn L, Leimeister C-A, Ounit R, Lonardi S, Morgenstern B. Rasbhari: optimizing spaced seeds for database searching, read mapping and alignment-free sequence comparison. PLOS Comput Biol. 2016;12(10):1005107.","journal-title":"PLOS Comput Biol"},{"key":"118_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13015-017-0092-1","volume":"12","author":"L No\u00e9","year":"2017","unstructured":"No\u00e9 L. Best hits of 11110110111: model-free selection and parameter-free sensitivity calculation of spaced seeds. Algorithms Mol Biol. 2017;12:1.","journal-title":"Algorithms Mol Biol"},{"key":"118_CR10","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01185431","volume":"12","author":"WI Chang","year":"1994","unstructured":"Chang WI, Lawler EL. Sublinear approximate string matching and biological applications. Algorithmica. 1994;12:327\u201344.","journal-title":"Algorithmica"},{"key":"118_CR11","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1089\/cmb.2006.13.336","volume":"13","author":"I Ulitsky","year":"2006","unstructured":"Ulitsky I, Burstein D, Tuller T, Chor B. The average common substring approach to phylogenomic reconstruction. J Comput Biol. 2006;13:336\u201350.","journal-title":"J Comput Biol"},{"key":"118_CR12","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1186\/1748-7188-7-34","volume":"7","author":"M Comin","year":"2012","unstructured":"Comin M, Verzotto D. Alignment-free phylogeny of whole genomes using underlying subwords. Algorithms Mol Biol. 2012;7:34.","journal-title":"Algorithms Mol Biol"},{"key":"118_CR13","doi-asserted-by":"crossref","first-page":"2000","DOI":"10.1093\/bioinformatics\/btu331","volume":"30","author":"C-A Leimeister","year":"2014","unstructured":"Leimeister C-A, Morgenstern B. kmacs: the $$k$$ k -mismatch average common substring approach to alignment-free sequence comparison. Bioinformatics. 2014;30:2000\u20138.","journal-title":"Bioinformatics"},{"key":"118_CR14","doi-asserted-by":"crossref","unstructured":"Aluru S, Apostolico A, Thankachan SV. Efficient alignment free sequence comparison with bounded mismatches. In: International conference on research in computational molecular biology; 2015. p. 1\u201312","DOI":"10.1007\/978-3-319-16706-0_1"},{"key":"118_CR15","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1089\/cmb.2015.0217","volume":"23","author":"SV Thankachan","year":"2016","unstructured":"Thankachan SV, Chockalingam SP, Liu Y, Apostolico A, Aluru S. ALFRED: a practical method for alignment-free distance computation. J Comput Biol. 2016;23:452\u201360.","journal-title":"J Comput Biol"},{"key":"118_CR16","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1186\/s13015-016-0072-x","volume":"11","author":"C Pizzi","year":"2016","unstructured":"Pizzi C. MissMax: alignment-free sequence comparison with mismatches through filtering and heuristics. Algorithms Mol Biol. 2016;11:6.","journal-title":"Algorithms Mol Biol"},{"key":"118_CR17","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1089\/cmb.2015.0235","volume":"23","author":"SV Thankachan","year":"2016","unstructured":"Thankachan SV, Apostolico A, Aluru S. A provably efficient algorithm for the $$k$$ k -mismatch average common substring problem. J Comput Biol. 2016;23:472\u201382.","journal-title":"J Comput Biol"},{"key":"118_CR18","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.tcs.2016.01.023","volume":"638","author":"A Apostolico","year":"2016","unstructured":"Apostolico A, Guerra C, Landau GM, Pizzi C. Sequence similarity measures based on bounded hamming distance. Theor Comput Sci. 2016;638:76\u201390.","journal-title":"Theor Comput Sci"},{"key":"118_CR19","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1186\/s12859-017-1658-0","volume":"18","author":"SV Thankachan","year":"2017","unstructured":"Thankachan SV, Chockalingam SP, Liu Y, Krishnan A, Aluru S. A greedy alignment-free distance estimator for phylogenetic inference. BMC Bioinform. 2017;18:238.","journal-title":"BMC Bioinform"},{"key":"118_CR20","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.tcs.2017.06.017","volume":"698","author":"UF Petrillo","year":"2017","unstructured":"Petrillo UF, Guerra C, Pizzi C. A new distributed alignment-free approach to compare whole proteomes. Theor Comput Sci. 2017;698:100\u201312.","journal-title":"Theor Comput Sci"},{"key":"118_CR21","doi-asserted-by":"crossref","first-page":"1487","DOI":"10.1089\/cmb.2009.0106","volume":"16","author":"B Haubold","year":"2009","unstructured":"Haubold B, Pfaffelhuber P, Domazet-Loso M, Wiehe T. Estimating mutation distances from unaligned genomes. J Comput Biol. 2009;16:1487\u2013500.","journal-title":"J Comput Biol"},{"key":"118_CR22","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1186\/1471-2105-6-123","volume":"6","author":"B Haubold","year":"2005","unstructured":"Haubold B, Pierstorff N, M\u00f6ller F, Wiehe T. Genome comparison without alignment using shortest unique substrings. BMC Bioinform. 2005;6:123.","journal-title":"BMC Bioinform"},{"key":"118_CR23","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1186\/1471-2105-7-541","volume":"7","author":"B Haubold","year":"2006","unstructured":"Haubold B, Wiehe T. How repetitive are genomes? BMC Bioinform. 2006;7:541.","journal-title":"BMC Bioinform"},{"key":"118_CR24","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1093\/nar\/gkt003","volume":"41","author":"H Yi","year":"2013","unstructured":"Yi H, Jin L. Co-phylog: an assembly-free phylogenomic approach for closely related organisms. Nucleic Acids Res. 2013;41:75.","journal-title":"Nucleic Acids Res"},{"key":"118_CR25","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1093\/bioinformatics\/btu815","volume":"31","author":"B Haubold","year":"2015","unstructured":"Haubold B, Kl\u00f6tzl F, Pfaffelhuber P. andi: Fast and accurate estimation of evolutionary distances between closely related genomes. Bioinformatics. 2015;31:1169\u201375.","journal-title":"Bioinformatics"},{"key":"118_CR26","unstructured":"Leimeister CA, Dencker T, Morgenstern B. Anchor points for genome alignment based on filtered spaced word matches. arXiv:1703.08792 [q-bio.GN]; 2017."},{"key":"118_CR27","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield D. Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge: Cambridge University Press; 1997."},{"key":"118_CR28","volume-title":"Evolution of protein molecules","author":"TH Jukes","year":"1969","unstructured":"Jukes TH, Cantor CR. Evolution of protein molecules. New York: Academy Press; 1969."},{"key":"118_CR29","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1093\/bioinformatics\/btw776","volume":"33","author":"C-A Leimeister","year":"2017","unstructured":"Leimeister C-A, Sohrabi-Jahromi S, Morgenstern B. Fast and accurate phylogeny reconstruction using filtered spaced-word matches. Bioinformatics. 2017;33:971\u20139.","journal-title":"Bioinformatics"},{"key":"118_CR30","unstructured":"Manber U, Myers G. Suffix arrays: a new method for on-line string searches. In: Proceedings of the first annual ACM-SIAM symposium on discrete algorithms SODA \u201990; 1990. p. 319\u201327."},{"key":"118_CR31","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1038\/msb.2011.75","volume":"7","author":"F Sievers","year":"2011","unstructured":"Sievers F, Wilm A, Dineen D, Gibson TJ, Karplus K, Li W, Lopez R, McWilliam H, Remmert M, S\u00f6ding J, Thompson JD, Higgins DG. Fast, scalable generation of high-quality protein multiple sequence alignments using Clustal Omega. Mol Syst Biol. 2011;7:539.","journal-title":"Mol Syst Biol"},{"key":"118_CR32","first-page":"406","volume":"4","author":"N Saitou","year":"1987","unstructured":"Saitou N, Nei M. The neighbor-joining method: a new method for reconstructing phylogenetic trees. Mol Biol Evol. 1987;4:406\u201325.","journal-title":"Mol Biol Evol"},{"key":"118_CR33","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"D Robinson","year":"1981","unstructured":"Robinson D, Foulds L. Comparison of phylogenetic trees. Math Biosci. 1981;53:131\u201347.","journal-title":"Math Biosci"},{"key":"118_CR34","first-page":"459","volume":"11","author":"MK Kuhner","year":"1994","unstructured":"Kuhner MK, Felsenstein J. A simulation comparison of phylogeny algorithms under equal and unequal evolutionary rates. Mol Biol Evol. 1994;11:459\u201368.","journal-title":"Mol Biol Evol"},{"key":"118_CR35","first-page":"164","volume":"5","author":"J Felsenstein","year":"1989","unstructured":"Felsenstein J. PHYLIP-phylogeny inference package (version 3.2). Cladistics. 1989;5:164\u20136.","journal-title":"Cladistics"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13015-017-0118-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T20:29:56Z","timestamp":1693340996000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/s13015-017-0118-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["118"],"URL":"https:\/\/doi.org\/10.1186\/s13015-017-0118-8","relation":{},"ISSN":["1748-7188"],"issn-type":[{"type":"electronic","value":"1748-7188"}],"subject":[],"published":{"date-parts":[[2017,12]]},"article-number":"27"}}