{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T14:58:34Z","timestamp":1760799514174},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,6,3]],"date-time":"2011-06-03T00:00:00Z","timestamp":1307059200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1186\/1748-7188-6-15","type":"journal-article","created":{"date-parts":[[2011,6,3]],"date-time":"2011-06-03T18:18:45Z","timestamp":1307125125000},"source":"Crossref","is-referenced-by-count":12,"title":["A sub-cubic time algorithm for computing the quartet distance between two general trees"],"prefix":"10.1186","volume":"6","author":[{"given":"Jesper","family":"Nielsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders K","family":"Kristensen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Mailund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian NS","family":"Pedersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,3]]},"reference":[{"key":"130_CR1","first-page":"119","volume-title":"Combinatorial mathematics, VI (Proc. 6th Austral. Conf), Lecture Notes in Mathematics, Springer","author":"DF Robinson","year":"1979","unstructured":"Robinson DF, Foulds LR: Comparison of weighted labelled trees. Combinatorial mathematics, VI (Proc. 6th Austral. Conf), Lecture Notes in Mathematics, Springer. 1979, 119-126."},{"key":"130_CR2","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/0022-5193(78)90137-6","volume":"73","author":"MS Waterman","year":"1978","unstructured":"Waterman MS, Smith TF: On the similarity of dendrograms. Journal of Theoretical Biology. 1978, 73: 789-800. 10.1016\/0022-5193(78)90137-6","journal-title":"Journal of Theoretical Biology"},{"key":"130_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00026-001-8006-8","volume":"5","author":"BL Allen","year":"2001","unstructured":"Allen BL, Steel M: Subtree transfer operations and their induced metrics on evolutionary trees. Annals of Combinatorics. 2001, 5: 1-13. 10.1007\/s00026-001-8006-8","journal-title":"Annals of Combinatorics"},{"key":"130_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0025-5564(81)90043-2","volume":"53","author":"DF Robinson","year":"1981","unstructured":"Robinson DF, Foulds LR: Comparison of phylogenetic trees. Mathematical Biosciences. 1981, 53: 131-147. 10.1016\/0025-5564(81)90043-2","journal-title":"Mathematical Biosciences"},{"key":"130_CR5","doi-asserted-by":"publisher","first-page":"193","DOI":"10.2307\/2413326","volume":"34","author":"G Estabrook","year":"1985","unstructured":"Estabrook G, McMorris F, Meacham C: Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units. Syst Zool. 1985, 34: 193-200. 10.2307\/2413326","journal-title":"Syst Zool"},{"issue":"2","key":"130_CR6","first-page":"126","volume":"42","author":"M Steel","year":"1993","unstructured":"Steel M, Penny D: Distribution of tree comparison metrics-some new results. Syst Biol. 1993, 42 (2): 126-141.","journal-title":"Syst Biol"},{"key":"130_CR7","first-page":"285","volume-title":"Proceedings of the 11th Annual Symposium on Discrete Algorithms (SODA)","author":"D Bryant","year":"2000","unstructured":"Bryant D, Tsang J, Kearney PE, Li M: Computing the quartet distance between evolutionary trees. Proceedings of the 11th Annual Symposium on Discrete Algorithms (SODA). 2000, 285-286."},{"key":"130_CR8","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s00453-003-1065-y","volume":"38","author":"GS Brodal","year":"2003","unstructured":"Brodal GS, Fagerberg R, Pedersen CNS: Computing the Quartet Distance Between Evolutionary Trees in Time O(n log n). Algorithmica. 2003, 38: 377-395.","journal-title":"Algorithmica"},{"key":"130_CR9","first-page":"77","volume-title":"Proc. of Workshop on Algorithms in Bioinformatics (WABI), Volume 3692 of Lecture Notes in Bioinformatics (LNBI), Springer-Verlag","author":"C Christiansen","year":"2005","unstructured":"Christiansen C, Mailund T, Pedersen CNS, Randers M: Algorithms for Computing the Quartet Distance between Trees of Arbitrary Degree. Proc. of Workshop on Algorithms in Bioinformatics (WABI), Volume 3692 of Lecture Notes in Bioinformatics (LNBI), Springer-Verlag. 2005, 77-88."},{"key":"130_CR10","volume-title":"Algorithms for Molecular Biology","author":"C Christiansen","year":"2006","unstructured":"Christiansen C, Mailund T, Pedersen CNS, Randers M, Stissing MS: Fast calculation of the quartet distance between trees of arbitrary degrees. Algorithms for Molecular Biology. 2006, 1:"},{"key":"130_CR11","first-page":"101","volume-title":"Proceedings of the 5th Asia-Pacific Bioinfomatics Conference 2007, Volume 5 of Series on Advances in Bioinformatics and Computational Biology","author":"M Stissing","year":"2007","unstructured":"Stissing M, Pedersen CNS, Mailund T, Brodal GS, Fagerberg R: Computing the quartet distance between evolutionary trees of bounded degree. Proceedings of the 5th Asia-Pacific Bioinfomatics Conference 2007, Volume 5 of Series on Advances in Bioinformatics and Computational Biology. Edited by: Sankoff D, Wang L, Chin F. 2007, 101-110."},{"key":"130_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith D, Winograd S: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation. 1990, 9: 251-281. 10.1016\/S0747-7171(08)80013-2","journal-title":"Journal of Symbolic Computation"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-6-15.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-6-15\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-6-15.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T23:45:19Z","timestamp":1548114319000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-6-15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,3]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["130"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-6-15","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,3]]},"article-number":"15"}}