Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-319-05269-4-33
Title: Reconciliation with non-binary gene trees revisited
Authors: Zheng, Y.
Zhang, L. 
Issue Date: 2014
Citation: Zheng, Y.,Zhang, L. (2014). Reconciliation with non-binary gene trees revisited. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 8394 LNBI : 418-432. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-319-05269-4-33
Abstract: By reconciling the phylogenetic tree of a gene family with the corresponding species tree, it is possible to infer lineage-specific duplications and losses with high confidence and hence annotate orthologs and paralogs. However, the currently available reconciliation methods for non-binary gene trees are computationally expensive for being applied on a genomic level. Here, an O(|G|∈+∈|S|) algorithm is presented to reconcile an arbitrary gene tree G with its corresponding species tree S, where |·| denotes the number of nodes in the corresponding tree. The improvement is achieved through two innovations: a fast computation of compressed child-image subtrees and efficient reconstruction of irreducible duplication histories. © 2014 Springer International Publishing Switzerland.
Source Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI: http://scholarbank.nus.edu.sg/handle/10635/104617
ISBN: 9783319052687
ISSN: 16113349
DOI: 10.1007/978-3-319-05269-4-33
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

39
checked on Nov 2, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.