{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T03:31:47Z","timestamp":1699846307514},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,20]],"date-time":"2012-11-20T00:00:00Z","timestamp":1353369600000},"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":[[2012,12]]},"DOI":"10.1186\/1748-7188-7-31","type":"journal-article","created":{"date-parts":[[2012,11,20]],"date-time":"2012-11-20T19:14:01Z","timestamp":1353438841000},"source":"Crossref","is-referenced-by-count":16,"title":["Gene tree correction for reconciliation and species tree inference"],"prefix":"10.1186","volume":"7","author":[{"given":"Krister M","family":"Swenson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Doroftei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nadia","family":"El-Mabrouk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,20]]},"reference":[{"key":"173_CR1","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1038\/35057039","volume":"409","author":"WH Li","year":"2001","unstructured":"Li WH, Gu Z, Wang H, Nekrutenko A: Evolutionary analysis of the human genome. Nature. 2001, 409: 847-849. 10.1038\/35057039","journal-title":"Nature"},{"key":"173_CR2","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1089\/cmb.2006.13.320","volume":"13","author":"D Durand","year":"2006","unstructured":"Durand D, Hald\u00f3rsson BV, Vernot B: A hybrid micro-macro-evolutionary approach to gene tree reconstruction. J Comput Biol. 2006, 13: 320-335. 10.1089\/cmb.2006.13.320","journal-title":"J Comput Biol"},{"issue":"6","key":"173_CR3","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/S0169-5347(03)00033-8","volume":"18","author":"J Zhang","year":"2003","unstructured":"Zhang J: Evolution by gene duplication: an update. TRENDS Ecol Evol. 2003, 18 (6): 292-298. 10.1016\/S0169-5347(03)00033-8","journal-title":"TRENDS Ecol Evol"},{"key":"173_CR4","doi-asserted-by":"publisher","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: Fitting the gene lineage into its species lineage, a parsimony strategy illustrated by cladograms constructed from globin sequences. Syst Zool. 1979, 28: 132-163. 10.2307\/2412519","journal-title":"Syst Zool"},{"key":"173_CR5","first-page":"93","volume":"6398","author":"J-P Doyon","year":"2010","unstructured":"Doyon J-P, Scornavacca C, Gorbunov K, Szolloso G, Ranwez V, Berry V: An effi. algo. for gene\/species trees parsim. reconc. with losses, dup. and transf. J Comp Biol. 2010, 6398: 93-108.","journal-title":"J Comp Biol"},{"key":"173_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1145\/974614.974660","volume-title":"Proceedings of the Eight Annual International Conference on Computational Molecular Biology, RECOMB","author":"M Hallett","year":"2004","unstructured":"Hallett M, Lagergren J, Tofigh A: Simultaneous identification of duplications and lateral transfers. Proceedings of the Eight Annual International Conference on Computational Molecular Biology, RECOMB. Edited by: Bourne PE, Gusfield D. New York: ACM, 2004, 347-356."},{"key":"173_CR7","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1109\/TCBB.2010.14","volume":"8","author":"A Tofigh","year":"2011","unstructured":"Tofigh A, Hallett M, Lagergren J: Simultaneous identification of duplications and lateral gene transfers. IEEE\/ACM Trans Comput Biol Bioinf. 2011, 8: 517-535.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"173_CR8","first-page":"46","volume-title":"Proceedings of the Thirteenth Annual International Conference on Computational Molecular Biology, RECOMB","author":"C Chauve","year":"2009","unstructured":"Chauve C, El-Mabrouk N: New perspectives on gene family evolution: losses in reconciliation and a link with supertrees. Proceedings of the Thirteenth Annual International Conference on Computational Molecular Biology, RECOMB. Edited by: Batzoglou S S. volume 5541 of LNCS, Springer, 2009, 46-58."},{"key":"173_CR9","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1089\/106652700750050871","volume":"7","author":"K Chen","year":"2000","unstructured":"Chen K, Durand D, Farach-Colton M: Notung: Dating gene duplications using gene family trees. J Comput Biol. 2000, 7: 429-447. 10.1089\/106652700750050871","journal-title":"J Comput Biol"},{"key":"173_CR10","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1137\/S0097539798343362","volume":"30","author":"B Ma","year":"2000","unstructured":"Ma B, Li M, Zhang L: From gene trees to species trees. SIAM J Comput. 2000, 30: 729-752. 10.1137\/S0097539798343362","journal-title":"SIAM J Comput"},{"key":"173_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1006\/mpev.1996.0071","volume":"6","author":"R Guig\u00f3","year":"1996","unstructured":"Guig\u00f3 R, Muchnik I, Smith TF: Reconstruction of ancient molecular phylogeny. Mol Phylogenet Evol. 1996, 6: 189-213. 10.1006\/mpev.1996.0071","journal-title":"Mol Phylogenet Evol"},{"key":"173_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1090\/dimacs\/037\/04","volume":"37","author":"RDM Page","year":"1997","unstructured":"Page RDM, Charleston MA: Reconciled trees and incongruent gene and species trees. DIMACS Ser Discrete Mathematics and Theor Comput Sci. 1997, 37: 57-70.","journal-title":"DIMACS Ser Discrete Mathematics and Theor Comput Sci"},{"key":"173_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.tcs.2005.05.016","volume":"347","author":"P Bonizzoni","year":"2005","unstructured":"Bonizzoni P, Vedova Della G, Dondi R: Reconciling a gene tree to a species tree under the duplication cost model. Theor Comput Sci. 2005, 347: 36-53. 10.1016\/j.tcs.2005.05.016","journal-title":"Theor Comput Sci"},{"key":"173_CR14","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.tcs.2006.05.019","volume":"359","author":"P Gorecki","year":"2006","unstructured":"Gorecki P, Tiuryn J: DLS-trees: a model of evolutionary scenarios. Theor Comput Sci. 2006, 359: 378-399. 10.1016\/j.tcs.2006.05.019","journal-title":"Theor Comput Sci"},{"key":"173_CR15","first-page":"58","volume":"43","author":"RDM Page","year":"1994","unstructured":"Page RDM: Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas. Syst Biol. 1994, 43: 58-77.","journal-title":"Syst Biol"},{"key":"173_CR16","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1093\/bioinformatics\/14.9.819","volume":"14","author":"RDM Page","year":"1998","unstructured":"Page RDM: Genetree: comparing gene and species phylogenies using reconciled trees. Bioinformatics. 1998, 14: 819-820. 10.1093\/bioinformatics\/14.9.819","journal-title":"Bioinformatics"},{"key":"173_CR17","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1145\/332306.332359","volume-title":"Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, RECOMB","author":"MT Hallett","year":"2000","unstructured":"Hallett MT, Lagergren J: New algorithms for the duplication-loss model. Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, RECOMB. Edited by: Shamir R, Miyano S, Istrail S, Pevzner P, Waterman MS. New York: ACM, 2000, 138-146."},{"key":"173_CR18","doi-asserted-by":"publisher","first-page":"R141","DOI":"10.1186\/gb-2007-8-7-r141","volume":"8","author":"MW Hahn","year":"2007","unstructured":"Hahn MW: Bias in phylogenetic tree reconciliation methods: implications for vertebrate genome evolution. Genome Biol. 2007, 8: R141. 10.1186\/gb-2007-8-7-r141","journal-title":"Genome Biol"},{"key":"173_CR19","first-page":"235","volume-title":"Proceedings of the 12th Conference on Computing and Combinatorics (COCOON), volume 4112 of Lecture Notes in Computer Science","author":"WC Chang","year":"2006","unstructured":"Chang WC, Eulenstein O: Reconciling gene trees with apparent polytomies. Proceedings of the 12th Conference on Computing and Combinatorics (COCOON), volume 4112 of Lecture Notes in Computer Science. Edited by: Chen DZ, Leepages DT. Taipei, Taiwan, 2006, 235-244."},{"key":"173_CR20","first-page":"106","volume-title":"WABI, volume 7534 of LNBI\/LNBI","author":"M Lafond","year":"2012","unstructured":"Lafond M, Swenson KM, El-Mabrouk N: An optimal reconciliation algorithm for gene trees with polytomies. WABI, volume 7534 of LNBI\/LNBI. 2012, 106-122."},{"key":"173_CR21","volume-title":"Combinatorial Pattern Matching (CPM)","author":"R Dondi","year":"2012","unstructured":"Dondi R, El-Mabrouk N: Minimum leaf removal for reconciliation: complexity and algorithms. Combinatorial Pattern Matching (CPM). accepted 2012."},{"key":"173_CR22","first-page":"76","volume-title":"WABI, volume 6833 of LNBI\/LNBI","author":"A Doroftei","year":"2011","unstructured":"Doroftei A, El-Mabrouk N: Removing noise from gene trees. WABI, volume 6833 of LNBI\/LNBI. 2011, 76-91."},{"key":"173_CR23","doi-asserted-by":"publisher","first-page":"1043","DOI":"10.1089\/cmb.2008.0054","volume":"15","author":"C Chauve","year":"2008","unstructured":"Chauve C, Doyon J-P, El-Mabrouk N: Gene family evolution by duplication, speciation and loss. J Comput Biol. 2008, 15: 1043-1062. 10.1089\/cmb.2008.0054","journal-title":"J Comput Biol"},{"key":"173_CR24","doi-asserted-by":"publisher","first-page":"e197","DOI":"10.1371\/journal.pgen.0030197","volume":"3","author":"MW Hahn","year":"2007","unstructured":"Hahn MW, Han MV, Han S-G: Gene family evolution across 12 drosophilia genomes. PLoS Genet. 2007, 3: e197. 10.1371\/journal.pgen.0030197","journal-title":"PLoS Genet"},{"key":"173_CR25","first-page":"537","volume-title":"LNCS, volume 2452 of WABI","author":"Page R D M","year":"2002","unstructured":"Modified mincut supertrees. LNCS, volume 2452 of WABI. 2002, 537-551."},{"key":"173_CR26","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0166-218X(00)00202-X","volume":"105","author":"C Semple","year":"2000","unstructured":"Semple C, Steel M: A supertree method for rooted trees. Discrete Appl Math. 2000, 105: 147-158. 10.1016\/S0166-218X(00)00202-X","journal-title":"Discrete Appl Math"},{"key":"173_CR27","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1109\/TCBB.2006.58","volume":"3","author":"S Snir","year":"2006","unstructured":"Snir S, Rao S: Using max cut to enhance rooted trees consistency. IEEE\/ACM Trans Comput Biol Bioinf. 2006, 3: 323-333.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"173_CR28","volume-title":"Hypergraphs:Combinatorics of Finite Sets, volume 45","author":"C Berge","year":"1989","unstructured":"Berge C: Hypergraphs:Combinatorics of Finite Sets, volume 45. Amsterdam, North-Holland, 1989.","edition":"45"},{"key":"173_CR29","first-page":"165","volume-title":"Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms","author":"J Hao","year":"1992","unstructured":"Hao J, Orlin JB: A faster algorithm for finding the minimum cut in a graph. Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms. 1992, 165-174."},{"issue":"5","key":"173_CR30","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1137\/S0097539796313477","volume":"30","author":"R Cole","year":"2000","unstructured":"Cole R, Farach-Colton M, Hariharan R, Przytycka T, Thorup M: An o(n\\log n) algorithm for the maximum agreement subtree problem for binary trees. SIAM J Comput. 2000, 30 (5): 1385-1404. 10.1137\/S0097539796313477","journal-title":"SIAM J Comput"},{"key":"173_CR31","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01908078","volume":"2","author":"CR Finden","year":"1995","unstructured":"Finden CR, Gordon AD: Obtaining common pruned trees. J Classif. 1995, 2: 255-276.","journal-title":"J Classif"},{"key":"173_CR32","doi-asserted-by":"publisher","first-page":"1656","DOI":"10.1137\/S0097539794269461","volume":"26","author":"A Amir","year":"1997","unstructured":"Amir A, Keselman D: Maximum agreement subtree in a set of evolutionary trees: matrics and efficient algorithms. SIAM J Comput. 1997, 26: 1656-1669. 10.1137\/S0097539794269461","journal-title":"SIAM J Comput"},{"key":"173_CR33","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(93)90181-8","volume":"48","author":"M Steel","year":"1993","unstructured":"Steel M, Warnow T: Kaikoura tree theorems:computing the maximum agreement subtree. Inform Process Lett. 1993, 48: 77-82. 10.1016\/0020-0190(93)90181-8","journal-title":"Inform Process Lett"},{"key":"173_CR34","unstructured":"Bryant D: Building trees, hunting for trees and comparing trees: Theory and method in phylogenetic analysis. PhD dissertation, Department of Mathematics, University of Canterbury, UK; 1997."},{"issue":"6","key":"173_CR35","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(95)00110-X","volume":"55","author":"M Farach","year":"1995","unstructured":"Farach M, Przytycka TM, Thorup M: On the agreement of many trees. Inf Process Lett. 1995, 55 (6): 297-301. 10.1016\/0020-0190(95)00110-X","journal-title":"Inf Process Lett"},{"key":"173_CR36","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1089\/cmb.1997.4.177","volume":"4","author":"LX Zhang","year":"1997","unstructured":"Zhang LX: On Mirkin-Muchnik-Smith conjecture for comparing molecular phylogenies. J Comput Biol. 1997, 4: 177-188. 10.1089\/cmb.1997.4.177","journal-title":"J Comput Biol"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-7-31.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-7-31\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-7-31.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T23:48:39Z","timestamp":1548114519000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-7-31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,20]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["173"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-7-31","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,20]]},"article-number":"31"}}