{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:53:03Z","timestamp":1740135183950,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"S8","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1186\/s12859-017-1658-0","type":"journal-article","created":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T05:40:17Z","timestamp":1496814017000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["A greedy alignment-free distance estimator for phylogenetic inference"],"prefix":"10.1186","volume":"18","author":[{"given":"Sharma V.","family":"Thankachan","sequence":"first","affiliation":[]},{"given":"Sriram P.","family":"Chockalingam","sequence":"additional","affiliation":[]},{"given":"Yongchao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ambujam","family":"Krishnan","sequence":"additional","affiliation":[]},{"given":"Srinivas","family":"Aluru","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,7]]},"reference":[{"key":"1658_CR1","first-page":"1409","volume":"38","author":"RR Sokal","year":"1958","unstructured":"Sokal RR. A statistical method for evaluating systematic relationships. Univ Kans Sci Bull. 1958; 38:1409\u201338.","journal-title":"Univ Kans Sci Bull"},{"issue":"4","key":"1658_CR2","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(4):406\u201325.","journal-title":"Mol Biol Evol"},{"key":"1658_CR3","doi-asserted-by":"crossref","unstructured":"Stewart CA, Hart D, Berry DK, Olsen GJ, Wernert EA, Fischer W. Parallel implementation and performance of fastdnaml-a program for maximum likelihood phylogenetic inference. In: Supercomputing, ACM\/IEEE 2001 Conference. IEEE: 2001. p. 32\u20132.","DOI":"10.1145\/582034.582054"},{"key":"1658_CR4","doi-asserted-by":"crossref","unstructured":"Ott M, Zola J, Stamatakis A, Aluru S. Large-scale maximum likelihood-based phylogenetic analysis on the ibm bluegene\/l. In: Proceedings of the 2007 ACM\/IEEE Conference on Supercomputing. ACM: 2007. p. 4.","DOI":"10.1145\/1362622.1362628"},{"key":"1658_CR5","unstructured":"Liu Y, Schmidt B, Maskell DL. Parallel reconstruction of neighbor-joining trees for large multiple sequence alignments using cuda. In: Parallel & Distributed Processing, 2009. IPDPS 2009. IEEE International Symposium On. IEEE: 2009. p. 1\u20138."},{"issue":"9","key":"1658_CR6","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1093\/bioinformatics\/btr140","volume":"27","author":"J Zhou","year":"2011","unstructured":"Zhou J, Liu X, Stones DS, Xie Q, Wang G. Mrbayes on a graphics processing unit. Bioinformatics. 2011; 27(9):1255\u201361.","journal-title":"Bioinformatics"},{"issue":"4","key":"1658_CR7","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1093\/bioinformatics\/btg005","volume":"19","author":"S Vinga","year":"2003","unstructured":"Vinga S, Almeida J. Alignment-free sequence comparison-a review. Bioinformatics. 2003; 19(4):513\u201323.","journal-title":"Bioinformatics"},{"key":"1658_CR8","doi-asserted-by":"crossref","unstructured":"Leimeister CA, Boden M, Horwege S, Lindner S, Morgenstern B. Fast alignment-free sequence comparison using spaced-word frequencies. Bioinformatics. 2014; 30(14):1991. doi: http:\/\/dx.doi.org\/10.1093\/bioinformatics\/btu177 , http:\/\/dx.doi.org\/10.1093\/bioinformatics\/btu177 .","DOI":"10.1093\/bioinformatics\/btu177"},{"issue":"6","key":"1658_CR9","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/BF02602924","volume":"29","author":"BE Blaisdell","year":"1989","unstructured":"Blaisdell BE. Effectiveness of measures requiring and not requiring prior sequence alignment for estimating the dissimilarity of natural sequences. J Mol Evol. 1989; 29(6):526\u201337.","journal-title":"J Mol Evol"},{"issue":"2","key":"1658_CR10","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1111\/j.0006-341X.2001.00441.x","volume":"57","author":"TJ Wu","year":"2001","unstructured":"Wu TJ, Hsieh YC, Li LA. Statistical measures of dna sequence dissimilarity under markov chain models of base composition. Biometrics. 2001; 57(2):441\u20138.","journal-title":"Biometrics"},{"issue":"1","key":"1658_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1471-2105-5-113","volume":"5","author":"RC Edgar","year":"2004","unstructured":"Edgar RC. Muscle: a multiple sequence alignment method with reduced time and space complexity. BMC Bioinforma. 2004; 5(1):1.","journal-title":"BMC Bioinforma"},{"issue":"10","key":"1658_CR12","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1093\/nar\/gkp285","volume":"37","author":"Y Sun","year":"2009","unstructured":"Sun Y, Cai Y, Liu L, Yu F, Farrell ML, McKendree W, Farmerie W. Esprit: estimating species richness using large collections of 16s rrna pyrosequences. Nucleic Acids Res. 2009; 37(10):76\u20136.","journal-title":"Nucleic Acids Res"},{"issue":"2","key":"1658_CR13","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(2):336\u201350.","journal-title":"J Comput Biol"},{"issue":"14","key":"1658_CR14","doi-asserted-by":"crossref","first-page":"2000","DOI":"10.1093\/bioinformatics\/btu331","volume":"30","author":"CA Leimeister","year":"2014","unstructured":"Leimeister CA, Morgenstern B. kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison. Bioinformatics. 2014; 30(14):2000\u20138.","journal-title":"Bioinformatics"},{"key":"1658_CR15","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. Springer: 2015. p. 1\u201312.","DOI":"10.1007\/978-3-319-16706-0_1"},{"issue":"10","key":"1658_CR16","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(10):1487\u2013500.","journal-title":"J Comput Biol"},{"key":"1658_CR17","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"},{"issue":"6","key":"1658_CR18","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1016\/j.ipl.2015.03.006","volume":"115","author":"T Flouri","year":"2015","unstructured":"Flouri T, Giaquinta E, Kobert K, Ukkonen E. Longest common substrings with k mismatches. Inf Process Lett. 2015; 115(6):643\u20137.","journal-title":"Inf Process Lett"},{"key":"1658_CR19","doi-asserted-by":"crossref","unstructured":"Manzini G. Longest common prefix with mismatches. In: International Symposium on String Processing and Information Retrieval. Springer: 2015. p. 299\u2013310.","DOI":"10.1007\/978-3-319-23826-5_29"},{"issue":"6","key":"1658_CR20","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-mismatch average common substring problem. J Comput Biol. 2016; 23(6):472\u201382.","journal-title":"J Comput Biol"},{"issue":"6","key":"1658_CR21","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(6):452\u201360.","journal-title":"J Comput Biol"},{"issue":"1","key":"1658_CR22","doi-asserted-by":"crossref","first-page":"1","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. Algorithm Mol Biol. 2016; 11(1):1.","journal-title":"Algorithm Mol Biol"},{"key":"1658_CR23","doi-asserted-by":"crossref","unstructured":"Weiner P. Linear pattern matching algorithms. In: Switching and Automata Theory, 1973. SWAT\u201908. IEEE Conference Record of 14th Annual Symposium On. IEEE: 1973. p. 1\u201311.","DOI":"10.1109\/SWAT.1973.13"},{"issue":"1","key":"1658_CR24","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/0221005","volume":"21","author":"L Devroye","year":"1992","unstructured":"Devroye L, Szpankowski W, Rais B. A note on the height of suffix trees. SIAM J Comput. 1992; 21(1):48\u201353.","journal-title":"SIAM J Comput"},{"key":"1658_CR25","unstructured":"Mori Y. Libdivsufsort: a lightweight suffix array construction library. 2003."},{"key":"1658_CR26","doi-asserted-by":"crossref","unstructured":"Gog S, Beller T, Moffat A, Petri M. From theory to practice: Plug and play with succinct data structures. In: International Symposium on Experimental Algorithms. Springer: 2014. p. 326\u201337.","DOI":"10.1007\/978-3-319-07959-2_28"},{"key":"1658_CR27","doi-asserted-by":"crossref","unstructured":"Kasai T, Lee G, Arimura H, Arikawa S, Park K. Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Annual Symposium on Combinatorial Pattern Matching. Springer: 2001. p. 181\u201392.","DOI":"10.1007\/3-540-48194-X_17"},{"key":"1658_CR28","doi-asserted-by":"crossref","unstructured":"Bender MA, Farach-Colton M. The lca problem revisited. In: Latin American Symposium on Theoretical Informatics. Springer: 2000. p. 88\u201394.","DOI":"10.1007\/10719839_9"},{"issue":"6","key":"1658_CR29","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1038\/ismej.2009.150","volume":"4","author":"RJ Newton","year":"2010","unstructured":"Newton RJ, Griffin LE, Bowles KM, Meile C, Gifford S, Givens CE, Howard EC, King E, Oakley CA, Reisch CR, et al.Genome characteristics of a generalist marine bacterial lineage. ISME J. 2010; 4(6):784\u201398.","journal-title":"ISME J"},{"issue":"1","key":"1658_CR30","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/prot.20527","volume":"61","author":"JD Thompson","year":"2005","unstructured":"Thompson JD, Koehl P, Ripp R, Poch O. Balibase 3.0: latest developments of the multiple sequence alignment benchmark. Proteins Struct Funct Bioinforma. 2005; 61(1):127\u201336.","journal-title":"Proteins Struct Funct Bioinforma"},{"key":"1658_CR31","unstructured":"Felsenstein J. {PHYLIP}: phylogenetic inference package, version 3.5 c. 1993."},{"issue":"1","key":"1658_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1471-2105-8-460","volume":"8","author":"DH Huson","year":"2007","unstructured":"Huson DH, Richter DC, Rausch C, Dezulian T, Franz M, Rupp R. Dendroscope: an interactive viewer for large phylogenetic trees. BMC Bioinforma. 2007; 8(1):1.","journal-title":"BMC Bioinforma"},{"key":"1658_CR33","doi-asserted-by":"crossref","unstructured":"Thankachan SV, Chockalingam SP, Liu Y, Krishnan A, Aluru S. A greedy alignment-free distance estimator for phylogenetic inference. In: International Conference on Computational Advances in Bio and Medical Sciences (ICCABS). IEEE: 2015. p. 1\u20131.","DOI":"10.1109\/ICCABS.2015.7344711"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-017-1658-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T14:03:54Z","timestamp":1569420234000},"score":1,"resource":{"primary":{"URL":"http:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-017-1658-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":33,"journal-issue":{"issue":"S8","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["1658"],"URL":"https:\/\/doi.org\/10.1186\/s12859-017-1658-0","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2017,6]]},"article-number":"238"}}