id: 05796278
dt: a
an: 05796278
au: Zhang, Louxin; Cui, Yun
ti: An efficient method for DNA-based species assignment via gene tree and
    species tree reconciliation.
so: Moulton, Vincent (ed.) et al., Algorithms in bioinformatics. 10th
    international workshop, WABI 2010, Liverpool, UK, September 6‒8,
    2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15293-1/pbk).
    Lecture Notes in Computer Science 6293. Lecture Notes in
    Bioinformatics, 300-311 (2010).
py: 2010
pu: Berlin: Springer
la: EN
cc: 
ut: DNA barcoding; species delimitation; gene tree and species tree
    reconciliation; deep coalescence; dene duplication and loss
ci: 
li: doi:10.1007/978-3-642-15294-8_25
ab: Summary: 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++.
rv: