{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:03:21Z","timestamp":1725487401173},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422426"},{"type":"electronic","value":"9783540457275"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","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":[[2001]]},"DOI":"10.1007\/3-540-45727-5_8","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:25:28Z","timestamp":1184603128000},"page":"84-98","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Phylogenetic Reconstruction Algorithms Based on Weighted 4-Trees"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Ranwez","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Gascuel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,28]]},"reference":[{"key":"8_CR1","unstructured":"J. P. Barth lemy and A. Gu noche. Trees and Proximity Representation. John Wiley & sons, 1990."},{"key":"8_CR2","unstructured":"V. Berry. M thodes et algorithmes pour reconstruire les arbres de l\u2019 volut ion. PhD thesis, Univ. Montpellier II, d cembre 1997."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0304-3975(99)00235-2","volume":"240","author":"V. Berry","year":"2000","unstructured":"V. Berry and O. Gascuel. Inferring evolutionary trees with strong combinatorial evidence. Theoretical Computer Science, 240:271\u2013298, 2000.","journal-title":"Theoretical Computer Science"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/BF01734359","volume":"17","author":"J. Felsenstein","year":"1981","unstructured":"J. Felsenstein. Evolutionary trees from DNA sequences: a maximum likelihood approach. J. Mol. Evol., 17:368\u2013376, 1981.","journal-title":"J. Mol. Evol."},{"key":"8_CR5","unstructured":"J. Felsenstein. Phylogeny inference package (version 3.2). Cladistics, 5, 1989."},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1093\/oxfordjournals.molbev.a025808","volume":"14","author":"O. Gascuel","year":"1997","unstructured":"O. Gascuel. BIONJ: An improved version of the nj algorithm based on a simple model of sequence data. Mol. Biol. Evol., 14:685\u2013695, 1997.","journal-title":"Mol. Biol. Evol."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"S. Kumar. A stepwise algorithm for finding minimum evolution trees. Mol. Biol. Evol., 1996.","DOI":"10.1093\/oxfordjournals.molbev.a025618"},{"issue":"2","key":"8_CR8","first-page":"239","volume":"43","author":"T. Margush","year":"1981","unstructured":"T. Margush and F.R. McMorris. Consensus n-trees. Bulletin of Math. Biol., 43(2):239\u2013244, 1981.","journal-title":"Bulletin of Math. Biol."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"A. Rambaut and N.C. Grassly. Seq-gen: An application for the monte carlo simulation of dna sequence evolution along phylogenetic trees. Comput. Appl. Biosci., 1997.","DOI":"10.1093\/bioinformatics\/13.3.235"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02618470","volume":"9","author":"M. Steel","year":"1992","unstructured":"M. Steel. The complexity of reconstructing trees from qualitative characters and subtrees. J. of Classification, 9:91\u2013116, 1992.","journal-title":"J. of Classification"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1093\/oxfordjournals.molbev.a025756","volume":"14","author":"K. Strimmer","year":"1997","unstructured":"K. Strimmer, N. Goldman, and A. von Haeseler. Baysian probabilities and quartet puzzling. Mol. Biol. Evol., 14:210\u2013211, 1997.","journal-title":"Mol. Biol. Evol."},{"issue":"7","key":"8_CR12","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1093\/oxfordjournals.molbev.a025664","volume":"13","author":"K. Strimmer","year":"1996","unstructured":"K. Strimmer and A. von Haeseler. Quartet puzzling: a quartet maximum-likelihood method for reconstructing tree topologies. Mol. Biol. Evol., 13(7):964\u2013969, 1996.","journal-title":"Mol. Biol. Evol."},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1093\/oxfordjournals.molbev.a026151","volume":"16","author":"S. J. Willson","year":"1999","unstructured":"S. J. Willson. Building phylogenetic trees from quartets by using local inconsistency measure. Mol. Biol. Evol., 16:685\u2013693, 1999.","journal-title":"Mol. Biol. Evol."}],"container-title":["Lecture Notes in Computer Science","Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45727-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T23:44:38Z","timestamp":1558482278000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45727-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422426","9783540457275"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45727-5_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"28 June 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}