@inproceedings{d269d50d0d0d4372b0e013b3c0fc3af1,
title = "Estimating large distances in phylogenetic reconstruction",
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.",
author = "Huson, {Daniel H.} and {Ann Smith}, Kelly and Tandy Warnow",
year = "1999",
language = "English (US)",
isbn = "3540664270",
volume = "1668",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "271--285",
booktitle = "Algorithm Engineering - 3rd International Workshop, WAE 1999, Proceedings",
address = "Germany",
note = "3rd International Workshop on Algorithm Engineering, WAE 1999 ; Conference date: 19-07-1999 Through 21-07-1999",
}