{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:57:31Z","timestamp":1742399851553},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T00:00:00Z","timestamp":1167350400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,2,14]]},"DOI":"10.1007\/s10878-006-9025-5","type":"journal-article","created":{"date-parts":[[2006,12,28]],"date-time":"2006-12-28T19:06:18Z","timestamp":1167332778000},"page":"223-242","source":"Crossref","is-referenced-by-count":3,"title":["Fast algorithms for computing the tripartition-based distance between phylogenetic networks"],"prefix":"10.1007","volume":"13","author":[{"given":"Nguyen Bao","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"C. Thach","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Wing-Kin","family":"Sung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,12,29]]},"reference":[{"key":"9025_CR1","doi-asserted-by":"crossref","unstructured":"Bryant D, Moulton V (2002) NeighborNet: an agglomerative method for the construc-tion of planar phylogenetic networks. In: Proceedings of the 2nd workshop on algorithms in bioinformatics (WABI 2002), vol 2452 of LNCS. Springer, pp 375\u2013391","DOI":"10.1007\/3-540-45784-4_28"},{"issue":"1","key":"9025_CR2","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.tcs.2004.12.012","volume":"335","author":"C Choy","year":"2005","unstructured":"Choy C, Jansson J, Sadakane K, Sung W-K (2005) Computing the maximum agr-eement of phylogenetic networks. Theor Comput Sci 335(1):93\u2013107","journal-title":"Theor Comput Sci"},{"key":"9025_CR3","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press, Cambridge, MA, USA"},{"key":"9025_CR4","doi-asserted-by":"crossref","first-page":"2124","DOI":"10.1126\/science.284.5423.2124","volume":"284","author":"WF Doolittle","year":"1999","unstructured":"Doolittle WF (1999) Phylogenetic classification and the universal tree. Science 284:2124\u20132128","journal-title":"Science"},{"key":"9025_CR5","doi-asserted-by":"crossref","unstructured":"Gusfield D, Bansal V (2005) A fundamental decomposition theory for phylogenetic networks and incompatible characters. In: Proceedings of the 9th annual international conference on re-search in computational molecular biology (RECOMB 2005), pp 217\u2013232","DOI":"10.1007\/11415770_17"},{"key":"9025_CR6","doi-asserted-by":"crossref","unstructured":"Gusfield D, Eddhu S, Langley C (2003) Efficient reconstruction of phylogenetic networks with constrained recombination. In: Proceedings of the computational systems bioinformatics conference (CSB2003), pp 363\u2013374","DOI":"10.1109\/CSB.2003.1227337"},{"issue":"2","key":"9025_CR7","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel D, Tarjan RE (1984) Fast algorithms for finding nearest common ancestors. SIAM J Comput 13(2):338\u2013355","journal-title":"SIAM J Comput"},{"issue":"2","key":"9025_CR8","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0025-5564(90)90123-G","volume":"98","author":"J Hein","year":"1990","unstructured":"Hein J (1990) Reconstructing evolution of sequences subject to recombination using parsimony. Math Biosci 98(2):185\u2013200","journal-title":"Math Biosci"},{"issue":"3","key":"9025_CR9","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.ipl.2004.04.003","volume":"91","author":"W-K Hon","year":"2004","unstructured":"Hon W-K, Kao M-Y, Lam TW, Sung W-K, Yiu S-M (2004) Non-shared edges and nearest neighbor interchanges revisited. Inf Process Lett 91(3):129\u2013134","journal-title":"Inf Process Lett"},{"key":"9025_CR10","doi-asserted-by":"crossref","unstructured":"Huson DH, Dezulian T, Kl\u00f6pper T, Steel M (2004) Phylogenetic super-networks from partial trees. In: Proceedings of the 4th workshop on algorithms in bioinformatics (WABI 2004), pp 388\u2013399","DOI":"10.1007\/978-3-540-30219-3_33"},{"key":"9025_CR11","doi-asserted-by":"crossref","unstructured":"Huson DH, Klopper T, Lockhart PJ, Steel MA (2005) Reconstruction of reticulate networks from gene trees. In: Proceedings of the 9th annual international conference on re-search in computational molecular biology (RECOMB 2005), pp 233\u2013249","DOI":"10.1007\/11415770_18"},{"key":"9025_CR12","doi-asserted-by":"crossref","unstructured":"Huynh TND, Jansson J, Nguyen NB, Sung WK (2005) Constructing a smallest refining galled phylogenetic network. In: Proceedings of the 9th annual international conference on re-search in computational molecular biology (RECOMB 2005), pp 265\u2013280","DOI":"10.1007\/11415770_20"},{"key":"9025_CR13","unstructured":"Jansson J, Nguyen NB, Sung WK (2005) Algorithms for combining rooted triplets into a galled phylogenetic network. In: Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms (SODA 2005), pp 349\u2013358"},{"key":"9025_CR14","doi-asserted-by":"crossref","unstructured":"Jansson J, Sung W-K (2004a) Inferring a level-1 phylogenetic network from a dense set of rooted triplets. In: Proceedings of the 10th international computing and combinatorics conference (COCOON 2004)","DOI":"10.1007\/978-3-540-27798-9_49"},{"key":"9025_CR15","doi-asserted-by":"crossref","unstructured":"Jansson J, Sung WK (2004b) The maximum agreement of two nested phylogenetic networks. In: Proceedings of the 15th annual international symposium on algorithms and computation (ISAAC 2004), pp 581\u2013593","DOI":"10.1007\/978-3-540-30551-4_51"},{"issue":"1","key":"9025_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCBB.2004.13","volume":"1","author":"BME Moret","year":"2004","unstructured":"Moret BME, Nakhleh L, Warnow T, Linder CR, Tholse A, Padolina A, Sun J, Timme R (2004) Phylogenetic networks: Modeling, reconstructibility, and accuracy. IEEE Trans Comput Biol Bioinf 1(1):1\u201312","journal-title":"IEEE Trans Comput Biol Bioinf"},{"key":"9025_CR17","unstructured":"Nakhleh L, Sun J, Warnow T, Linder CR, Moret BME, Tholse A (2003) Towards the development of computational tools for evaluating phylogenetic reconstruction methods. In: Proceedings of the 8th pacific symposium on biocomputing (PSB 2003), pp 315\u2013326"},{"key":"9025_CR18","unstructured":"Nakhleh L, Warnow T, Linder CR (2004) Reconstructing reticulate evolution in spe-cies\u2014theory and practice. In: Proceedings of the 8th annual international conference on re-search in computational molecular biology (RECOMB 2004), pp 337\u2013346"},{"issue":"1","key":"9025_CR19","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0169-5347(00)02026-7","volume":"16","author":"D Posada","year":"2001","unstructured":"Posada D, Crandall KA (2001) Intraspecific gene genealogies: trees grafting into networks. TRENDS Ecol Evol 16(1):37\u201345","journal-title":"TRENDS Ecol Evol"},{"key":"9025_CR20","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"},{"issue":"1","key":"9025_CR21","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1089\/106652701300099119","volume":"8","author":"L Wang","year":"2001","unstructured":"Wang L, Zhang K, Zhang L (2001) Perfect phylogenetic networks with recombination. J Comput Biol 8(1):69\u201378","journal-title":"J Comput Biol"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9025-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-006-9025-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-006-9025-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:10Z","timestamp":1559276290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-006-9025-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,29]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,2,14]]}},"alternative-id":["9025"],"URL":"https:\/\/doi.org\/10.1007\/s10878-006-9025-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,29]]}}}