Estimating large distances in phylogenetic reconstruction

Daniel H. Huson, Kelly Ann Smith, Tandy J. Warnow

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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 languageEnglish (US)
Title of host publicationAlgorithm Engineering - 3rd International Workshop, WAE 1999, Proceedings
EditorsJeffrey S. Vitter, Christos D. Zaroliagis
Number of pages15
ISBN (Print)3540664270, 9783540664277
StatePublished - 1999
Externally publishedYes
Event3rd International Workshop on Algorithm Engineering, WAE 1999 - London, United Kingdom
Duration: Jul 19 1999Jul 21 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other3rd International Workshop on Algorithm Engineering, WAE 1999
Country/TerritoryUnited Kingdom

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Estimating large distances in phylogenetic reconstruction'. Together they form a unique fingerprint.

Cite this