{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T17:40:01Z","timestamp":1710610801317},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,9,19]],"date-time":"2009-09-19T00:00:00Z","timestamp":1253318400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s11047-009-9156-6","type":"journal-article","created":{"date-parts":[[2009,9,18]],"date-time":"2009-09-18T18:23:24Z","timestamp":1253298204000},"page":"421-435","source":"Crossref","is-referenced-by-count":2,"title":["Beyond evolutionary trees"],"prefix":"10.1007","volume":"9","author":[{"given":"Gianluca","family":"Della Vedova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Dondi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulio","family":"Pavesi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Pirola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,19]]},"reference":[{"issue":"4","key":"9156_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s00026-004-0228-0","volume":"8","author":"M Baroni","year":"2004","unstructured":"Baroni M, Semple C, Steel M (2004) A framework for representing reticulate evolution. Ann Comb 8(4):391\u2013408","journal-title":"Ann Comb"},{"issue":"6","key":"9156_CR3","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1007\/BF02945456","volume":"18","author":"P Bonizzoni","year":"2003","unstructured":"Bonizzoni P, Della Vedova G, Dondi R, Li J (2003) The haplotyping problem: an overview of computational models and solutions. J Comput Sci Technol 18(6):675\u2013688","journal-title":"J Comput Sci Technol"},{"issue":"1-2","key":"9156_CR2","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.tcs.2005.05.016","volume":"347","author":"P Bonizzoni","year":"2005","unstructured":"Bonizzoni P, Della Vedova G, Dondi R (2005) Reconciling a gene tree to a species tree under the duplication cost model. Theor Comput Sci 347(1\u20132):192\u2013216","journal-title":"Theor Comput Sci"},{"key":"9156_CR4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/9780470253441.ch7","volume-title":"Bioinformatics algorithms: techniques and applications","author":"P Bonizzoni","year":"2008","unstructured":"Bonizzoni P, Della Vedova G, Dondi R, Mauri G (2008) The comparison of phylogenetic networks: algorithms and complexity. In: Mandoiu I, Zelikovsky A (eds) Bioinformatics algorithms: techniques and applications. Wiley-Interscience Publisher, Hoboken, NJ, pp 143\u2013173"},{"key":"9156_CR5","doi-asserted-by":"crossref","unstructured":"Burleigh JG, Bansal MS, Wehe A, Eulenstein O (2008) Locating multiple gene duplications through reconciled trees. In: Proceedings of the 12th conference on research in computational molecular biology, (RECOMB), pp 273\u2013284","DOI":"10.1007\/978-3-540-78839-3_24"},{"key":"9156_CR6","doi-asserted-by":"crossref","unstructured":"Chan BM-Y, Chan JW-T, Chin FYL, Fung SPY, Kao M-Y (2006) Linear-time haplotype inference on pedigrees without recombinations. In: Proceedings of the 6th workshop on algorithms in bioinformatics (WABI), pp 56\u201367","DOI":"10.1007\/11851561_6"},{"key":"9156_CR7","doi-asserted-by":"crossref","unstructured":"Chang W-C, Eulenstein O (2006) Reconciling gene trees with apparent polytomies. In: Proceedings of the 12th conference on computing and combinatorics (COCOON), pp 235\u2013244","DOI":"10.1007\/11809678_26"},{"issue":"4","key":"9156_CR8","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10878-006-8212-8","volume":"11","author":"B Dasgupta","year":"2006","unstructured":"Dasgupta B, Ferrarini S, Gopalakrishnan U, Paryani NR (2006) Inapproximability results for the lateral gene transfer problem. J Comb Optim 11(4):387\u2013405","journal-title":"J Comb Optim"},{"key":"9156_CR9","doi-asserted-by":"crossref","unstructured":"Doi K, Li J, Jiang T (2003) Minimum recombinant haplotype configuration on tree pedigrees. In: Proceedings of the 3rd workshop on algorithms in bioinformatics (WABI). Springer, pp 339\u2013353","DOI":"10.1007\/978-3-540-39763-2_25"},{"key":"9156_CR10","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01908078","volume":"2","author":"C Finden","year":"1985","unstructured":"Finden C, Gordon A (1985) Obtaining common pruned trees. J Classif 2:255\u2013276","journal-title":"J Classif"},{"issue":"2","key":"9156_CR11","doi-asserted-by":"crossref","first-page":"132","DOI":"10.2307\/2412519","volume":"28","author":"M Goodman","year":"1979","unstructured":"Goodman M, Czelusniak J, Moore GW, Romero-Herrera AE, Matsuda G (1979) Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst Zool 28(2):132\u2013163","journal-title":"Syst Zool"},{"key":"9156_CR12","doi-asserted-by":"crossref","unstructured":"G\u00f2recki P (2004) Reconciliation problems for duplication, loss and horizontal gene transfer. In: Proceedings of 8th conference on research in computational molecular biology, (RECOMB), pp 316\u2013325","DOI":"10.1145\/974614.974656"},{"issue":"1-3","key":"9156_CR13","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/j.tcs.2006.05.019","volume":"359","author":"P G\u00f2recki","year":"2006","unstructured":"G\u00f2recki P, Tiuryn J (2006) DLS-trees: a model of evolutionary scenarios. Theor Comput Sci 359(1\u20133):378\u2013399","journal-title":"Theor Comput Sci"},{"issue":"2","key":"9156_CR14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1006\/mpev.1996.0071","volume":"6","author":"R Guig\u00f2","year":"1996","unstructured":"Guig\u00f2 R, Muchnik I, Smith T (1996) Reconstruction of ancient molecular phylogeny. Mol Phylogenet Evol 6(2):189\u2013213","journal-title":"Mol Phylogenet Evol"},{"issue":"6","key":"9156_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0219720006002478","volume":"4","author":"A Gupta","year":"2006","unstructured":"Gupta A, Manuch J, Zhao X, Stacho L (2006) Characterization of the existence of galled-tree networks. J Bioinform Comput Biol 4(6):1","journal-title":"J Bioinform Comput Biol"},{"key":"9156_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees and sequences: computer science and computational biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield D (1997) Algorithms on strings, trees and sequences: computer science and computational biology. Cambridge University Press, Cambridge"},{"issue":"1","key":"9156_CR18","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1142\/S0219720004000521","volume":"2","author":"D Gusfield","year":"2004","unstructured":"Gusfield D, Eddhu S, Langley CH (2004) Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J Bioinform Comput Biol 2(1):173\u2013214","journal-title":"J Bioinform Comput Biol"},{"issue":"10","key":"9156_CR17","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1089\/cmb.2006.0137","volume":"14","author":"D Gusfield","year":"2007","unstructured":"Gusfield D, Bansal V, Bafna V, Song YS (2007) A decomposition theory for phylogenetic networks and incompatible characters. J Comput Biol 14(10):1247\u20131272","journal-title":"J Comput Biol"},{"key":"9156_CR19","doi-asserted-by":"crossref","unstructured":"Hallett M, Lagergren J (2001) Efficient algorithms for lateral gene transfer problems. In: Proceedings of 5th annual international conference on research in computational molecular biology, (RECOMB), pp 149\u2013156","DOI":"10.1145\/369133.369188"},{"key":"9156_CR20","doi-asserted-by":"crossref","unstructured":"Hallett M, Lagergren J, Tofigh A (2004) Simultaneous identification of duplications and lateral transfers. In: Proceedings of 8th annual international conference on research in computational molecular biology, (RECOMB), pp 347\u2013356","DOI":"10.1145\/974614.974660"},{"issue":"2","key":"9156_CR21","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0893-9659(96)00012-2","volume":"9","author":"A Hamel","year":"1996","unstructured":"Hamel A, Steel MA (1996) Finding a common compatible tree is NP-hard for sequences and trees. Appl Math Lett 9(2):55\u201360","journal-title":"Appl Math Lett"},{"issue":"1","key":"9156_CR22","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1142\/S0219720003000204","volume":"1","author":"J Li","year":"2003","unstructured":"Li J, Jiang T (2003) Efficient inference of haplotypes from genotypes on a pedigree. J Bioinform Comput Biol 1(1):41\u201369","journal-title":"J Bioinform Comput Biol"},{"issue":"3","key":"9156_CR23","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/j.tcs.2007.02.036","volume":"378","author":"L Liu","year":"2007","unstructured":"Liu L, Chen X, Xiao J, Jiang T (2007) Complexity and approximation of the minimum recombinant haplotype configuration problem. Theor Comput Sci 378(3):316\u2013330","journal-title":"Theor Comput Sci"},{"issue":"3","key":"9156_CR24","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1137\/S0097539798343362","volume":"30","author":"B Ma","year":"2000","unstructured":"Ma B, Li M, Zhang L (2000) From gene trees to species trees. SIAM J Comput 30(3):729\u2013752","journal-title":"SIAM J Comput"},{"issue":"1","key":"9156_CR25","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/TCBB.2004.10","volume":"1","author":"BME Moret","year":"2004","unstructured":"Moret BME, Nakhleh L, Warnow T, Linder CR, Tholse A, Padolina A, Sun J, Timme RE (2004) Phylogenetic networks: modeling, reconstructibility, and accuracy. IEEE\/ACM Trans Comput Biol Bioinform 1(1):13\u201323","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"key":"9156_CR26","doi-asserted-by":"crossref","unstructured":"Nakhleh L, Ruths DA, Wang L-S (2005a) RIATA-HGT: a fast and accurate heuristic for reconstructing horizontal gene transfer. In: Proceedings of the 11th conference on computing and combinatorics (COCOON), pp 84\u201393","DOI":"10.1007\/11533719_11"},{"issue":"6","key":"9156_CR27","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1089\/cmb.2005.12.796","volume":"12","author":"L Nakhleh","year":"2005","unstructured":"Nakhleh L, Warnow T, Linder CR, John KS (2005b) Reconstructing reticulate evolution in species: theory and practice. J Comput Biol 12(6):796\u2013811","journal-title":"J Comput Biol"},{"key":"9156_CR28","first-page":"58","volume":"43","author":"R Page","year":"1994","unstructured":"Page R (1994) Maps between trees and cladistic analysis of historical associations among genes. Syst Biol 43:58\u201377","journal-title":"Syst Biol"},{"issue":"2","key":"9156_CR29","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1093\/sysbio\/49.2.363","volume":"49","author":"M Steel","year":"2000","unstructured":"Steel M, B\u00f6cker S, Dress A (2000) Simple but fundamental limits for supertree and consensus tree methods. Syst Biol 49(2):363\u2013368","journal-title":"Syst Biol"},{"key":"9156_CR30","unstructured":"Than C, Nakhleh L (2008) SPR-based tree reconciliation: non-binary trees and multiple solutions. In: Proceedings of the 6th Asia-Pacific bioinformatics conference (APBC), pp 251\u2013260"},{"issue":"4","key":"9156_CR31","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1089\/cmb.2007.A010","volume":"14","author":"C Than","year":"2007","unstructured":"Than C, Ruths D, Innan H, Nakhleh L (2007) Confounding factors in HGT detection: statistical error, coalescent effects, and multiple solutions. J Comput Biol 14(4):517\u2013535","journal-title":"J Comput Biol"},{"key":"9156_CR32","doi-asserted-by":"crossref","unstructured":"van Iersel L, Keijsper J, Kelk S, Stougie L, Hagen F, Boekhout T (2008) Constructing level-2 phylogenetic networks from triplets. In: Proceedings of 5th annual international conference on computational molecular biology, (RECOMB), pp 450\u2013462","DOI":"10.1007\/978-3-540-78839-3_40"},{"issue":"1","key":"9156_CR33","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"},{"key":"9156_CR34","unstructured":"Xiao J, Liu L, Xia L, Jiang T (2007) Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree. In: Proceedings of the 18th symposium on discrete algorithms (SODA), pp 655\u2013664"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-009-9156-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-009-9156-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-009-9156-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,16]],"date-time":"2024-03-16T17:03:05Z","timestamp":1710608585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-009-9156-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,19]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9156"],"URL":"https:\/\/doi.org\/10.1007\/s11047-009-9156-6","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,19]]}}}