{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T00:46:22Z","timestamp":1713919582077},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T00:00:00Z","timestamp":1335571200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s00453-012-9644-4","type":"journal-article","created":{"date-parts":[[2012,4,27]],"date-time":"2012-04-27T14:22:54Z","timestamp":1335536574000},"page":"419-449","source":"Crossref","is-referenced-by-count":4,"title":["Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences"],"prefix":"10.1007","volume":"66","author":[{"given":"Radu","family":"Mihaescu","sequence":"first","affiliation":[]},{"given":"Cameron","family":"Hill","sequence":"additional","affiliation":[]},{"given":"Satish","family":"Rao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,28]]},"reference":[{"key":"9644_CR1","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0025-5564(78)90089-5","volume":"40","author":"J. Cavender","year":"1978","unstructured":"Cavender, J.: Taxonomy with confidence. Math. Biosci. 40, 271\u2013280 (1978)","journal-title":"Math. Biosci."},{"key":"9644_CR2","first-page":"281","volume-title":"Proceedings of RECOMB 2006","author":"C. Daskalakis","year":"2006","unstructured":"Daskalakis, C., Hill, C., Jaffe, A., Mihaescu, R., Mossel, E., Rao, S.: Maximal accurate forest from distance matrices. In: Proceedings of RECOMB 2006, vol. 3909, pp. 281\u2013295. Springer, Berlin (2006)"},{"key":"9644_CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1145\/1132516.1132540","volume-title":"Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing (STOC 2006)","author":"C. Daskalakis","year":"2006","unstructured":"Daskalakis, C., Mossel, E., Roch, S.: Optimal phylogenetic reconstruction. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing (STOC 2006), pp. 159\u2013168 (2006)"},{"issue":"2","key":"9644_CR4","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1137\/09075576X","volume":"25","author":"C. Daskalakis","year":"2011","unstructured":"Daskalakis, C., Mossel, E., Roch, S.: Phylogenies without branch bounds: contracting the short, pruning the deep. SIAM J. Discrete Math. 25(2), 872\u2013893 (2011)","journal-title":"SIAM J. Discrete Math."},{"key":"9644_CR5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/(SICI)1098-2418(199903)14:2<153::AID-RSA3>3.0.CO;2-R","volume":"14","author":"P.L. Erdos","year":"1997","unstructured":"Erdos, P.L., Steel, M., Szekely, L., Warnow, T.: A few logs suffice to build (almost) all trees\u00a0(I). Random Struct. Algorithms 14, 153\u2013184 (1997)","journal-title":"Random Struct. Algorithms"},{"issue":"1\u20132","key":"9644_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0304-3975(99)00028-6","volume":"221","author":"P.L. Erdos","year":"1999","unstructured":"Erdos, P.L., Steel, M.A., Szekely, L.A., Warnow, T.J.: A few logs suffice to build (almost) all trees\u00a0(II). Theor. Comput. Sci. 221(1\u20132), 77\u2013118 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"9644_CR7","doi-asserted-by":"crossref","first-page":"250","DOI":"10.2307\/2412305","volume":"22","author":"J.S. Farris","year":"1973","unstructured":"Farris, J.S.: A probability model for inferring evolutionary trees. Syst. Zool. 22, 250\u2013256 (1973)","journal-title":"Syst. Zool."},{"key":"9644_CR8","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.jtbi.2008.09.031","volume":"256","author":"M. Fischer","year":"2008","unstructured":"Fischer, M., Steel, M.: Sequence length bounds for resolving a deep phylogenetic divergence. J. Theor. Biol. 256, 247\u2013252 (2008)","journal-title":"J. Theor. Biol."},{"key":"9644_CR9","first-page":"379","volume-title":"Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008)","author":"I. Gronau","year":"2008","unstructured":"Gronau, I., Moran, S., Snir, S.: Fast and reliable reconstruction of phylogenetic trees with very short edges. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 379\u2013388 (2008)"},{"issue":"1","key":"9644_CR10","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1073\/pnas.78.1.454","volume":"78","author":"M. Kimura","year":"1981","unstructured":"Kimura, M.: Estimation of evolutionary distances between homologous nucleotide sequences. Proc. Natl. Acad. Sci. 78(1), 454\u2013458 (1981)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"5","key":"9644_CR11","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1089\/106652703322539015","volume":"10","author":"E. Mossel","year":"2003","unstructured":"Mossel, E.: On the impossibility of reconstructing ancestral data and phylogenies. J. Comput. Biol. 10(5), 669\u2013678 (2003)","journal-title":"J. Comput. Biol."},{"issue":"6","key":"9644_CR12","doi-asserted-by":"crossref","first-page":"2379","DOI":"10.1090\/S0002-9947-03-03382-8","volume":"356","author":"E. Mossel","year":"2004","unstructured":"Mossel, E.: Phase transitions in phylogeny. Trans. Am. Math. Soc. 356(6), 2379\u20132404 (2004)","journal-title":"Trans. Am. Math. Soc."},{"key":"9644_CR13","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1109\/TCBB.2007.1010","volume":"4","author":"E. Mossel","year":"2007","unstructured":"Mossel, E.: Distorted metrics on trees and phylogenetic forests. IEEE Comput. Biol. Bioinform. 4, 108\u2013116 (2007)","journal-title":"IEEE Comput. Biol. Bioinform."},{"key":"9644_CR14","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1109\/FOCS.2008.77","volume-title":"Proceedings of the 49th IEEE Symposium on Foundations of Computer Science (FOCS 2008)","author":"S. Roch","year":"2008","unstructured":"Roch, S.: Sequence length requirement of distance-based phylogeny reconstruction: breaking the polynomial barrier. In: Proceedings of the 49th IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 729\u2013738 (2008)"},{"key":"9644_CR15","series-title":"Mathematics and Its Applications","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198509424.001.0001","volume-title":"Phylogenetics","author":"C. Semple","year":"2003","unstructured":"Semple, C., Steel, M.: Phylogenetics. Mathematics and Its Applications, vol.\u00a022. Oxford University Press, Oxford (2003)"},{"key":"9644_CR16","unstructured":"Steel, M.: My favourite conjecture. Preprint (2001)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9644-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9644-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9644-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,23]],"date-time":"2024-04-23T23:58:15Z","timestamp":1713916695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9644-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,28]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["9644"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9644-4","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,28]]}}}