Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-15294-8_25
Title: An efficient method for DNA-based species assignment via gene tree and species tree reconciliation
Authors: Zhang, L. 
Cui, Y. 
Keywords: deep coalescence
dene duplication and loss
DNA barcoding
gene tree and species tree reconciliation
species delimitation
Issue Date: 2010
Citation: Zhang, L.,Cui, Y. (2010). An efficient method for DNA-based species assignment via gene tree and species tree reconciliation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 6293 LNBI : 300-311. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-15294-8_25
Abstract: DNA-based species assignment and delimitation are two important problems in systematic biology. In a recent work of O'Meara, species delimitation is investigated through coupling it with species tree inference in the framework of gene tree and species tree reconciliation. We present a polynomial time algorithm for splitting individuals into species to minimize the deep coalescence cost of the gene tree and species tree reconciliation, a species assignment problem arises from species delimitation via gene tree and species tree reconciliation. How to incorporate this proposed algorithm into the heuristic search strategy of O'Meara for species delimitation is also discussed. The proposed algorithm is implemented in C++. © 2010 Springer-Verlag.
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/104533
ISBN: 3642152937
ISSN: 03029743
DOI: 10.1007/978-3-642-15294-8_25
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

5
checked on Nov 12, 2019

Page view(s)

66
checked on Nov 9, 2019

Google ScholarTM

Check

Altmetric


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