{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T00:07:59Z","timestamp":1773274079661,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T00:00:00Z","timestamp":1245196800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Adv Data Anal Classif"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s11634-009-0041-z","type":"journal-article","created":{"date-parts":[[2009,6,16]],"date-time":"2009-06-16T08:33:48Z","timestamp":1245141228000},"page":"95-108","source":"Crossref","is-referenced-by-count":17,"title":["Comparison of alignment free string distances for complete genome phylogeny"],"prefix":"10.1007","volume":"3","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Guyon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9line","family":"Brochier-Armanet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Gu\u00e9noche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,6,17]]},"reference":[{"key":"41_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"SF Altschul","year":"1990","unstructured":"Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ (1990) Basic local alignment search tool. J Mol Biol 215: 403\u2013410","journal-title":"J Mol Biol"},{"key":"41_CR2","doi-asserted-by":"crossref","first-page":"1656","DOI":"10.1137\/S0097539794269461","volume":"26","author":"A Amir","year":"1997","unstructured":"Amir A, Keselman D (1997) Maximum agreement subtree in a set of evolutionary trees: metric and efficient algorithms. SIAM J Comput 26: 1656\u20131669","journal-title":"SIAM J Comput"},{"issue":"10","key":"41_CR3","doi-asserted-by":"crossref","first-page":"1391","DOI":"10.1093\/oxfordjournals.molbev.a026048","volume":"16","author":"PJ Deschavanne","year":"1999","unstructured":"Deschavanne PJ, Giron A (1999) Genomic signature: characterization and classification of species assessed by chaos game representation of sequences. Mol Biol Evol 16(10): 1391\u20131399","journal-title":"Mol Biol Evol"},{"key":"41_CR4","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1186\/1471-2105-5-113","volume":"5","author":"RC Edgar","year":"2004","unstructured":"Edgar RC (2004) MUSCLE: a multiple sequence alignment method with reduced time and space complexity . BMC Bioinformatics 5: 113","journal-title":"BMC Bioinformatics"},{"key":"41_CR5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.2307\/2413326","volume":"34","author":"GF Estabrook","year":"1985","unstructured":"Estabrook GF, McMorris FR, Meacham CA (1985) Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units. Syst Zool 34: 193\u2013200","journal-title":"Syst Zool"},{"key":"41_CR6","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1080\/10635150390235520","volume":"52","author":"S Guindon","year":"2003","unstructured":"Guindon S, Gascuel O (2003) A simple, fast and accurate algorithm to estimate large phylogenies by maximum likelihood. Syst Biol 52: 696\u2013704","journal-title":"Syst Biol"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Guyon F, Gu\u00e9noche A (2009) An evolutionary distance based on maximal unique matches. Commun Stat (in press)","DOI":"10.1080\/03610920903140213"},{"issue":"2","key":"41_CR8","first-page":"1","volume":"17","author":"BI Hao","year":"2003","unstructured":"Hao BI, Qi J, Wang B (2003) Prokaryotic phylogeny based on complete genomes without sequence alignment. Modern Phys Lett B 17(2): 1\u20134","journal-title":"Modern Phys Lett B"},{"issue":"10","key":"41_CR9","doi-asserted-by":"crossref","first-page":"2329","DOI":"10.1093\/bioinformatics\/bth324","volume":"15;21","author":"SR Henz","year":"2005","unstructured":"Henz SR, Huson DH, Auch AF, Nieselt-Struwe K, Schuster SC (2005) Whole-genome prokaryotic phylogeny. Bioinformatics 15;21(10): 2329\u20132335","journal-title":"Bioinformatics"},{"issue":"8","key":"41_CR10","doi-asserted-by":"crossref","first-page":"2163","DOI":"10.1093\/nar\/18.8.2163","volume":"18","author":"HJ Jeffrey","year":"1990","unstructured":"Jeffrey HJ (1990) Chaos game representation of gene structure. Nucleic Acids Res 18(8): 2163\u20132170","journal-title":"Nucleic Acids Res"},{"key":"41_CR11","volume-title":"A second course in stochastic processes","author":"S Karlin","year":"1981","unstructured":"Karlin S, Taylor H (1981) A second course in stochastic processes. Academic Press, New York"},{"key":"41_CR12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01731581","volume":"16","author":"M Kimura","year":"1980","unstructured":"Kimura M (1980) A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences. J Mol Evol 16: 111\u2013120","journal-title":"J Mol Evol"},{"key":"41_CR13","doi-asserted-by":"crossref","first-page":"R12","DOI":"10.1186\/gb-2004-5-2-r12","volume":"5","author":"S Kurtz","year":"2004","unstructured":"Kurtz S, Phillippy A, Delcher AL, Smoot M, Shumway M, Antonescu C, Salzberg SL (2004) Versatile and open software for comparing large genomes. Genome Biol 5: R12","journal-title":"Genome Biol"},{"issue":"16","key":"41_CR14","doi-asserted-by":"crossref","first-page":"2122","DOI":"10.1093\/bioinformatics\/btg295","volume":"19","author":"HH Otu","year":"2003","unstructured":"Otu HH, Sayood K (2003) A new sequence distance measure for phylogenetic tree construction. Bioinformatics 19(16): 2122\u20132130","journal-title":"Bioinformatics"},{"key":"41_CR15","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"DF Robinson","year":"1981","unstructured":"Robinson DF, Foulds LR (1981) Comparison of phylogenetic trees. Math Biosci 53: 131\u2013147","journal-title":"Math Biosci"},{"key":"41_CR16","first-page":"406","volume":"4","author":"N Saitou","year":"1987","unstructured":"Saitou N, Nei M (1987) The Neighbor-Joining method: a new method for reconstructing phylogenetic trees. Mol Biol Evol 4: 406\u2013425","journal-title":"Mol Biol Evol"},{"key":"41_CR17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1146\/annurev.micro.59.030804.121233","volume":"59","author":"B Snel","year":"2005","unstructured":"Snel B, Huynen MA, Dutilh BE (2005) Genome trees and the nature of genome evolution. Annu Rev Microbiol 59: 191\u2013209","journal-title":"Annu Rev Microbiol"},{"key":"41_CR18","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1089\/cmb.2006.13.336","volume":"13","author":"I Ulitsky","year":"2006","unstructured":"Ulitsky I, Burnstein D, Tuller T, Chor B (2006) The average common substring approach to phylogenomic reconstruction. J Comput Biol 13: 336\u2013350","journal-title":"J Comput Biol"},{"key":"41_CR19","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv J, Lempel A (1977) A universal algorithm for sequential data compression. IEEE Trans Inform Theory 23: 337\u2013343","journal-title":"IEEE Trans Inform Theory"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-009-0041-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11634-009-0041-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-009-0041-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T17:49:46Z","timestamp":1685036986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11634-009-0041-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,17]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["41"],"URL":"https:\/\/doi.org\/10.1007\/s11634-009-0041-z","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"value":"1862-5347","type":"print"},{"value":"1862-5355","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,17]]}}}