@inproceedings{59e5e1e05c3f4b5aad339fa24654a187,
title = "Constructing big trees from short sequences",
abstract = "The construction of evolutionary trees is a fundamental problem in biology, and yet methods for reconstructing evolutionary trees are not reliable when it comes to inferring accurate topologies of large divergent evolutionary trees from realistic length sequences. We address this problem and present a new polynomial time algorithm for reconstructing evolutionary trees called the Short Quartets Method which is consistent and which has greater statistical power than other polynomial time methods, such as Neighbor-Joining and the 3-approximation algorithm by Agarwala et al. (and the “Double Pivot” variant of the Agarwala et al. algorithm by Cohen and Farach) for the Loo-nearest tree problem. Our study indicates that our method will produce the correct topology from shorter sequences than can be guaranteed using these other methods.",
author = "Erd{\H o}s, {P{\'e}ter L.} and Steel, {Michael A.} and Sz{\'e}kely, {L{\'a}szl{\'o} A.} and Warnow, {Tandy J.}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1997.; 24th International Colloquium on Automata, Languages and Programming, ICALP 1997 ; Conference date: 07-07-1997 Through 11-07-1997",
year = "1997",
doi = "10.1007/3-540-63165-8_235",
language = "English (US)",
isbn = "3540631658",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
pages = "827--837",
editor = "Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela",
booktitle = "Automata, Languages and Programming - 24th International Colloquium, ICALP 1997, Proceedings",
address = "Germany",
}