Abstract
A major computational problem in biology is the reconstruction of evolutionary (A.K.A. "Phylogenetic") trees from biomolecular sequences. Most polynomial time phylogenetic reconstruction methods are distance-based, and take as input an estimation of the evolutionary distance between every pair of biomolecular sequences in the dataset. The estimation of evolutionary distances is standardized except when the set of biomolecular sequences is "Saturated", which means it contains a pair of sequences which are no more similar than two random sequences. In this case, the standard statistical techniques for estimating evolutionary distances cannot be used. In this study we explore the performance of three important distance-based phylogenetic reconstruction methods under the various techniques that have been proposed for estimating evolutionary distances when the dataset is saturated.
| Original language | English (US) |
|---|---|
| Title of host publication | Algorithm Engineering - 3rd International Workshop, WAE 1999, Proceedings |
| Publisher | Springer Verlag |
| Pages | 271-285 |
| Number of pages | 15 |
| Volume | 1668 |
| ISBN (Print) | 3540664270, 9783540664277 |
| State | Published - 1999 |
| Externally published | Yes |
| Event | 3rd International Workshop on Algorithm Engineering, WAE 1999 - London, United Kingdom Duration: Jul 19 1999 → Jul 21 1999 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1668 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 3rd International Workshop on Algorithm Engineering, WAE 1999 |
|---|---|
| Country | United Kingdom |
| City | London |
| Period | 7/19/99 → 7/21/99 |
Fingerprint
ASJC Scopus subject areas
- Computer Science(all)
- Theoretical Computer Science
Cite this
Estimating large distances in phylogenetic reconstruction. / Huson, Daniel H.; Ann Smith, Kelly; Warnow, Tandy.
Algorithm Engineering - 3rd International Workshop, WAE 1999, Proceedings. Vol. 1668 Springer Verlag, 1999. p. 271-285 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1668).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Estimating large distances in phylogenetic reconstruction
AU - Huson, Daniel H.
AU - Ann Smith, Kelly
AU - Warnow, Tandy
PY - 1999
Y1 - 1999
N2 - A major computational problem in biology is the reconstruction of evolutionary (A.K.A. "Phylogenetic") trees from biomolecular sequences. Most polynomial time phylogenetic reconstruction methods are distance-based, and take as input an estimation of the evolutionary distance between every pair of biomolecular sequences in the dataset. The estimation of evolutionary distances is standardized except when the set of biomolecular sequences is "Saturated", which means it contains a pair of sequences which are no more similar than two random sequences. In this case, the standard statistical techniques for estimating evolutionary distances cannot be used. In this study we explore the performance of three important distance-based phylogenetic reconstruction methods under the various techniques that have been proposed for estimating evolutionary distances when the dataset is saturated.
AB - A major computational problem in biology is the reconstruction of evolutionary (A.K.A. "Phylogenetic") trees from biomolecular sequences. Most polynomial time phylogenetic reconstruction methods are distance-based, and take as input an estimation of the evolutionary distance between every pair of biomolecular sequences in the dataset. The estimation of evolutionary distances is standardized except when the set of biomolecular sequences is "Saturated", which means it contains a pair of sequences which are no more similar than two random sequences. In this case, the standard statistical techniques for estimating evolutionary distances cannot be used. In this study we explore the performance of three important distance-based phylogenetic reconstruction methods under the various techniques that have been proposed for estimating evolutionary distances when the dataset is saturated.
UR - http://www.scopus.com/inward/record.url?scp=84957082913&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84957082913&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84957082913
SN - 3540664270
SN - 9783540664277
VL - 1668
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 271
EP - 285
BT - Algorithm Engineering - 3rd International Workshop, WAE 1999, Proceedings
PB - Springer Verlag
ER -