DocumentCode
1780240
Title
New sample complexity bounds for phylogenetic inference from multiple loci
Author
Dasarathy, Gautam ; Nowak, Robert ; Roch, Sebastian
Author_Institution
Electr. & Comput. Eng., Univ. of Wisconsin-Madison, Madison, WI, USA
fYear
2014
fDate
June 29 2014-July 4 2014
Firstpage
2037
Lastpage
2041
Abstract
We consider the problem of estimating the evolutionary history of a set of species (phylogeny or species tree) from several genes. It has been known however that the evolutionary history of individual genes (gene trees) might be topologically distinct from each other and from the underlying species tree, possibly confounding phylogenetic analysis. A further complication in practice is that one has to estimate gene trees from molecular sequences of finite length. We provide the first full data-requirement analysis of a species tree reconstruction method that takes into account estimation errors at the gene level. Under that criterion, we also devise a novel algorithm that provably improves over all previous methods in a regime of interest.
Keywords
biology computing; evolution (biological); genetics; trees (mathematics); data-requirement analysis; estimation errors; evolutionary history; gene trees; individual genes; molecular sequences; phylogenetic analysis; phylogenetic inference; phylogeny; species tree reconstruction method; Boolean functions; Data structures; Frequency locked loops; History; Silicon;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory (ISIT), 2014 IEEE International Symposium on
Conference_Location
Honolulu, HI
Type
conf
DOI
10.1109/ISIT.2014.6875191
Filename
6875191
Link To Document