{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T06:26:26Z","timestamp":1769149586134,"version":"3.49.0"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030008338","type":"print"},{"value":"9783030008345","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00834-5_13","type":"book-chapter","created":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T03:53:16Z","timestamp":1536292396000},"page":"227-241","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multi-SpaM: A Maximum-Likelihood Approach to Phylogeny Reconstruction Using Multiple Spaced-Word Matches and Quartet Trees"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Dencker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris-Andr\u00e9","family":"Leimeister","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Gerth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Bleidorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sagi","family":"Snir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burkhard","family":"Morgenstern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,8]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1093\/bioinformatics\/btq665","volume":"27","author":"SV Angiuoli","year":"2011","unstructured":"Angiuoli, S.V., Salzberg, S.L.: Mugsy: fast multiple alignment of closely related whole genomes. Bioinformatics 27, 334\u2013342 (2011)","journal-title":"Bioinformatics"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/s00239-018-9833-0","volume":"86","author":"E Avni","year":"2018","unstructured":"Avni, E., Yona, Z., Cohen, R., Snir, S.: The performance of two supertree schemes compared using synthetic and real data quartet input. J. Mol. Evol. 86, 150\u2013165 (2018)","journal-title":"J. Mol. Evol."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Ayad, L.A., Charalampopoulos, P., Iliopoulos, C.S., Pissis, S.P.: Longest common prefixes with $$k$$-errors and applications. arXiv:1801.04425 [cs.DS] (2018)","DOI":"10.1007\/978-3-030-00479-8_3"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.2307\/1222480","volume":"41","author":"B Baum","year":"1992","unstructured":"Baum, B.: Combining trees as a way of combining data sets for phylogenetic inference. Taxon 41, 3\u201310 (1992)","journal-title":"Taxon"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"28970","DOI":"10.1038\/srep28970","volume":"6","author":"G Bernard","year":"2016","unstructured":"Bernard, G., Chan, C.X., Ragan, M.A.: Alignment-free microbial phylogenomics under scenarios of sequence divergence, genome rearrangement and lateral genetic transfer. Sci. Rep. 6, 28970 (2016)","journal-title":"Sci. Rep."},{"key":"13_CR6","series-title":"Computational Biology","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-2330-9","volume-title":"Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life","author":"ORP Bininda-Emonds","year":"2004","unstructured":"Bininda-Emonds, O.R.P.: Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life. Computational Biology. Springer, Netherlands (2004). https:\/\/doi.org\/10.1007\/978-1-4020-2330-9"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"e1004985","DOI":"10.1371\/journal.pcbi.1004985","volume":"12","author":"R Bromberg","year":"2016","unstructured":"Bromberg, R., Grishin, N.V., Otwinowski, Z.: Phylogeny reconstruction with alignment-free method that corrects for horizontal gene transfer. PLoS Comput. Biol. 12, e1004985 (2016)","journal-title":"PLoS Comput. Biol."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1007\/s11227-016-1835-3","volume":"73","author":"G Cattaneo","year":"2017","unstructured":"Cattaneo, G., Ferraro Petrillo, U., Giancarlo, R., Roscigno, G.: An effective extension of the applicability of alignment-free biological sequence comparison algorithms with Hadoop. J. Supercomput. 73, 1467\u20131483 (2017)","journal-title":"J. Supercomput."},{"key":"13_CR9","unstructured":"Chiaromonte, F., Yap, V.B., Miller, W.: Scoring pairwise genomic sequence alignments. In: Altman, R.B., Dunker, A.K., Hunter, L., Klein, T.E. (eds.) Pacific Symposium on Biocomputing, Lihue, Hawaii, pp. 115\u2013126 (2002)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/11415770_23","volume-title":"Research in Computational Molecular Biology","author":"B Chor","year":"2005","unstructured":"Chor, B., Tuller, T.: Maximum likelihood of evolutionary trees is hard. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS, vol. 3500, pp. 296\u2013310. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11415770_23"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"S1","DOI":"10.1186\/1471-2105-15-S9-S1","volume":"15","author":"M Comin","year":"2014","unstructured":"Comin, M., Schimd, M.: Assembly-free genome comparison based on next-generation sequencing reads and variable length patterns. BMC Bioinform. 15, S1 (2014)","journal-title":"BMC Bioinform."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1093\/molbev\/msr268","volume":"29","author":"DA Dalquen","year":"2012","unstructured":"Dalquen, D.A., Anisimova, M., Gonnet, G.H., Dessimoz, C.: ALF - a simulation framework for genome evolution. Mol. Biol. Evol. 29, 1115\u20131123 (2012)","journal-title":"Mol. Biol. Evol."},{"key":"13_CR13","unstructured":"Dencker, T., Leimeister, C.A., Morgenstern, B.: Multi-SpaM: a maximum-likelihood approach to phylogeny reconstruction based on multiple spaced-word matches. arxiv.org\/abs\/1803.09222 [q-bio.PE] (2018). http:\/\/arxiv.org\/abs\/1703.08792"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1093\/sysbio\/19.1.83","volume":"19","author":"JS Farris","year":"1970","unstructured":"Farris, J.S.: Methods for computing wagner trees. Syst. Biol. 19, 83\u201392 (1970)","journal-title":"Syst. Biol."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/BF01734359","volume":"17","author":"J Felsenstein","year":"1981","unstructured":"Felsenstein, J.: Evolutionary trees from DNA sequences:a maximum likelihood approach. J. Mol. Evol. 17, 368\u2013376 (1981)","journal-title":"J. Mol. Evol."},{"key":"13_CR16","first-page":"164","volume":"5","author":"J Felsenstein","year":"1989","unstructured":"Felsenstein, J.: PHYLIP - phylogeny inference package (version 3.2). Cladistics 5, 164\u2013166 (1989)","journal-title":"Cladistics"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"406","DOI":"10.2307\/2412116","volume":"20","author":"W Fitch","year":"1971","unstructured":"Fitch, W.: Toward defining the course of evolution: minimum change for a specific tree topology. Syst. Zool. 20, 406\u2013416 (1971)","journal-title":"Syst. Zool."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0196-8858(82)80004-3","volume":"3","author":"L Foulds","year":"1982","unstructured":"Foulds, L., Graham, R.: The steiner problem in phylogeny is NP-complete. Adv. Appl. Math. 3, 43\u201349 (1982)","journal-title":"Adv. Appl. Math."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"16241","DOI":"10.1038\/nmicrobiol.2016.241","volume":"2","author":"M Gerth","year":"2016","unstructured":"Gerth, M., Bleidorn, C.: Comparative genomics provides a timeframe for Wolbachia evolution and exposes a recent biotin synthesis operon transfer. Nat. Microbiol. 2, 16241 (2016)","journal-title":"Nat. Microbiol."},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1186\/s13015-018-0125-4","volume":"13","author":"S Girotto","year":"2018","unstructured":"Girotto, S., Comin, M., Pizzi, C.: FSH: fast spaced seed hashing exploiting adjacent hashes. Algorithms Mol. Biol. 13, 8 (2018)","journal-title":"Algorithms Mol. Biol."},{"issue":"10","key":"13_CR21","doi-asserted-by":"publisher","first-page":"e1005107","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. 12(10), e1005107 (2016)","journal-title":"PLOS Comput. Biol."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"192","DOI":"10.3389\/fpls.2012.00192","volume":"3","author":"K Hatje","year":"2012","unstructured":"Hatje, K., Kollmar, M.: A phylogenetic analysis of the brassicales clade based on an alignment-free sequence comparison method. Front. Plant Sci. 3, 192 (2012)","journal-title":"Front. Plant Sci."},{"key":"13_CR23","doi-asserted-by":"publisher","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 31, 1169\u20131175 (2015)","journal-title":"Bioinformatics"},{"key":"13_CR24","doi-asserted-by":"publisher","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. 16, 1487\u20131500 (2009)","journal-title":"J. Comput. Biol."},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Horwege, S., et al.: Spaced words and kmacs: fast alignment-free sequence comparison based on inexact word matches. Nucl. Acids Res. 42, W7\u2013W11 (2014)","DOI":"10.1093\/nar\/gku398"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"2433","DOI":"10.1093\/bioinformatics\/btr368","volume":"27","author":"L Ilie","year":"2011","unstructured":"Ilie, L., Ilie, S., Bigvand, A.M.: SpEED: fast computation of sensitive spaced seeds. Bioinformatics 27, 2433\u20132434 (2011)","journal-title":"Bioinformatics"},{"key":"13_CR27","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1186\/1756-0500-5-123","volume":"5","author":"S Ilie","year":"2012","unstructured":"Ilie, S.: Efficient Computation of Spaced Seeds. BMC Res. Notes 5, 123 (2012)","journal-title":"BMC Res. Notes"},{"key":"13_CR28","doi-asserted-by":"publisher","first-page":"1991","DOI":"10.1093\/bioinformatics\/btu177","volume":"30","author":"CA 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 30, 1991\u20131999 (2014)","journal-title":"Bioinformatics"},{"key":"13_CR29","doi-asserted-by":"publisher","first-page":"2000","DOI":"10.1093\/bioinformatics\/btu331","volume":"30","author":"CA Leimeister","year":"2014","unstructured":"Leimeister, C.A., Morgenstern, B.: kmacs: the $$k$$-mismatch average common substring approach to alignment-free sequence comparison. Bioinformatics 30, 2000\u20132008 (2014)","journal-title":"Bioinformatics"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Leimeister, C.A., Schellhorn, J., Sch\u00f6bel, S., Gerth, M., Bleidorn, C., Morgenstern, B.: Prot-SpaM: Fast alignment-free phylogeny reconstruction based on whole-proteome sequences. bioRxiv (2018). https:\/\/doi.org\/10.1101\/306142","DOI":"10.1101\/306142"},{"key":"13_CR31","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1093\/bioinformatics\/btw776","volume":"33","author":"CA Leimeister","year":"2017","unstructured":"Leimeister, C.A., Sohrabi-Jahromi, S., Morgenstern, B.: Fast and accurate phylogeny reconstruction using filtered spaced-word matches. Bioinformatics 33, 971\u2013979 (2017)","journal-title":"Bioinformatics"},{"key":"13_CR32","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1186\/s13015-017-0118-8","volume":"12","author":"B Morgenstern","year":"2017","unstructured":"Morgenstern, B., Sch\u00f6bel, S., Leimeister, C.A.: Phylogeny reconstruction based on the length distribution of k-mismatch common substrings. Algorithms Mol. Biol. 12, 27 (2017)","journal-title":"Algorithms Mol. Biol."},{"key":"13_CR33","doi-asserted-by":"publisher","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. 10, 5 (2015)","journal-title":"Algorithms Mol. Biol."},{"key":"13_CR34","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1038\/ismej.2009.150","volume":"4","author":"R Newton","year":"2010","unstructured":"Newton, R., et al.: Genome characteristics of a generalist marine bacterial lineage. ISME J. 4, 784\u2013798 (2010)","journal-title":"ISME J."},{"key":"13_CR35","doi-asserted-by":"publisher","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. 12, 1 (2017)","journal-title":"Algorithms Mol. Biol."},{"key":"13_CR36","unstructured":"OpenMP Forum: OpenMP C and C++ Application Program Interface, Version 2.0. Technical report (2002). http:\/\/www.openmp.org"},{"key":"13_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-662-48221-6_21","volume-title":"Algorithms in Bioinformatics","author":"R Ounit","year":"2015","unstructured":"Ounit, R., Lonardi, S.: Higher classification accuracy of short metagenomic reads by discriminative spaced k-mers. In: Pop, M., Touzet, H. (eds.) WABI 2015. LNCS, vol. 9289, pp. 286\u2013295. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48221-6_21"},{"key":"13_CR38","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tcs.2017.06.017","volume":"698","author":"UF Petrillo","year":"2017","unstructured":"Petrillo, U.F., Guerra, C., Pizzi, C.: A new distributed alignment-free approach to compare whole proteomes. Theor. Comput. Sci. 698, 100\u2013112 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR39","doi-asserted-by":"publisher","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. 11, 6 (2016)","journal-title":"Algorithms Mol. Biol."},{"key":"13_CR40","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0303-2647(92)90007-L","volume":"28","author":"M Ragan","year":"1992","unstructured":"Ragan, M.: Matrix representation in reconstructing phylogenetic-relationships among the eukaryotes. Biosystems 28, 47\u201355 (1992)","journal-title":"Biosystems"},{"key":"13_CR41","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1146\/annurev-biodatasci-080917-013431","volume":"1","author":"J Ren","year":"2018","unstructured":"Ren, J., Bai, X., Lu, Y.Y., Tang, K., Wang, Y., Reinert, G., Sun, F.: Alignment-free sequence analysis and applications. Annu. Rev. Biomed. Data Sci. 1, 93\u2013114 (2018)","journal-title":"Annu. Rev. Biomed. Data Sci."},{"key":"13_CR42","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"DF Robinson","year":"1981","unstructured":"Robinson, D.F., Foulds, L.: Comparison of phylogenetic trees. Math. Biosci. 53, 131\u2013147 (1981)","journal-title":"Math. Biosci."},{"key":"13_CR43","doi-asserted-by":"publisher","first-page":"2634","DOI":"10.1038\/srep02634","volume":"3","author":"T Roychowdhury","year":"2013","unstructured":"Roychowdhury, T., Vishnoi, A., Bhattacharya, A.: Next-generation anchor based phylogeny (NexABP): constructing phylogeny from next-generation sequencing data. Sci. Rep. 3, 2634 (2013)","journal-title":"Sci. Rep."},{"key":"13_CR44","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. 4, 406\u2013425 (1987)","journal-title":"Mol. Biol. Evol."},{"key":"13_CR45","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1038\/msb.2011.75","volume":"7","author":"F Sievers","year":"2011","unstructured":"Sievers, F., et al.: Fast, scalable generation of high-quality protein multiple sequence alignments using Clustal Omega. Mol. Syst. Biol. 7, 539 (2011)","journal-title":"Mol. Syst. Biol."},{"key":"13_CR46","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TCBB.2008.133","volume":"7","author":"S Snir","year":"2010","unstructured":"Snir, S., Rao, S.: Quartets MaxCut: a divide and conquer quartets algorithm. IEEE\/ACM Trans. Comput. Biology Bioinform. 7, 704\u2013718 (2010)","journal-title":"IEEE\/ACM Trans. Comput. Biology Bioinform."},{"key":"13_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ympev.2011.06.021","volume":"62","author":"S Snir","year":"2012","unstructured":"Snir, S., Rao, S.: Quartet MaxCut: a fast algorithm for amalgamating quartet trees. Mol. Phylogenetics Evol. 62, 1\u20138 (2012)","journal-title":"Mol. Phylogenetics Evol."},{"key":"13_CR48","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1093\/bib\/bbt067","volume":"15","author":"K Song","year":"2014","unstructured":"Song, K., Ren, J., Reinert, G., Deng, M., Waterman, M.S., Sun, F.: New developments of alignment-free sequence comparison: measures, statistics and next-generation sequencing. Brief. Bioinform. 15, 343\u2013353 (2014)","journal-title":"Brief. Bioinform."},{"key":"13_CR49","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1089\/cmb.2012.0228","volume":"20","author":"K Song","year":"2013","unstructured":"Song, K., Ren, J., Zhai, Z., Liu, X., Deng, M., Sun, F.: Alignment-free sequence comparison based on next-generation sequencing reads. J. Comput. Biol. 20, 64\u201379 (2013)","journal-title":"J. Comput. Biol."},{"key":"13_CR50","doi-asserted-by":"publisher","first-page":"1312","DOI":"10.1093\/bioinformatics\/btu033","volume":"30","author":"A Stamatakis","year":"2014","unstructured":"Stamatakis, A.: RAxML version 8: a tool for phylogenetic analysis and post-analysis of large phylogenies. Bioinformatics 30, 1312\u20131313 (2014)","journal-title":"Bioinformatics"},{"key":"13_CR51","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"M Steel","year":"1992","unstructured":"Steel, M.: The complexity of reconstructing trees from qualitative characters and subtress. J. Classif. 9, 91\u2013116 (1992)","journal-title":"J. Classif."},{"key":"13_CR52","first-page":"57","volume":"17","author":"S Tavar\u00e9","year":"1986","unstructured":"Tavar\u00e9, S.: Some probabilistic and statistical problems on the analysis of DNA sequences. Lect. Math. Life Sci. 17, 57\u201386 (1986)","journal-title":"Lect. Math. Life Sci."},{"key":"13_CR53","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1089\/cmb.2015.0235","volume":"23","author":"SV Thankachan","year":"2016","unstructured":"Thankachan, S.V., Apostolico, A., Aluru, S.: A provably efficient algorithm for the $$k$$-mismatch average common substring problem. J. Comput. Biol. 23, 472\u2013482 (2016)","journal-title":"J. Comput. Biol."},{"key":"13_CR54","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1186\/s12859-017-1658-0","volume":"18","author":"SV Thankachan","year":"2017","unstructured":"Thankachan, S.V., Chockalingam, S.P., Liu, Y., Aluru, A.K.S.: A greedy alignment-free distance estimator for phylogenetic inference. BMC Bioinform. 18, 238 (2017)","journal-title":"BMC Bioinform."},{"key":"13_CR55","doi-asserted-by":"publisher","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. 13, 336\u2013350 (2006)","journal-title":"J. Comput. Biol."},{"key":"13_CR56","doi-asserted-by":"publisher","first-page":"e75","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. Nucl. Acids Res. 41, e75 (2013)","journal-title":"Nucl. Acids Res."},{"key":"13_CR57","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1186\/s13059-017-1319-7","volume":"18","author":"A Zielezinski","year":"2017","unstructured":"Zielezinski, A., Vinga, S., Almeida, J., Karlowski, W.M.: Alignment-free sequence comparison: benefits, applications, and tools. Genome Biol. 18, 186 (2017)","journal-title":"Genome Biol."}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00834-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T22:53:05Z","timestamp":1693867985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-00834-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030008338","9783030008345"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00834-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}