From Quartets to Phylogenetic Trees

Authors:
Benny Chor
Affiliations:
-
Venue:
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Year:
1998

Citing 12
Cited 1

Reconstructing the shape of a tree from observed dissimilarity data

Advances in Applied Mathematics
Triangulating Vertex-Colored Graphs

SIAM Journal on Discrete Mathematics
A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed

SIAM Journal on Computing
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
The asymmetric median tree—a new model for building consensus trees

Discrete Applied Mathematics - Special volume on computational molecular biology
From four-taxon trees to phylogenies (preliminary report): the case of mammalian evolution

RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
A fast algorithm for the computation and enumeration of perfect phylogenies when the number of character states is fixed

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of numerical taxonomy (fitting distances by tree metrics)

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Numerical taxonomy on data: experimental results

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Constructing Big Trees from Short Sequences

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Two Strikes Against Perfect Phylogeny

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Inferring Evolutionary Trees with Strong Combinatorial Evidence

Inferring Evolutionary Trees with Strong Combinatorial Evidence

Minimum Quartet Inconsistency Is Fixed Parameter Tractable

CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constructing phylogenetic (or evolutionary) trees from biological data is a classical problem in biology, and it still is a major challenge today. Most realistic formulations of the problem, which take errors into account, give rise to hard computational problems. In this survey paper we concentrate on quartet based tree reconstruction methods. We briefly describe the general tree reconstruction problem, and discuss the motivation for using quartet based reconstruction. We then turn to the computational complexity of this reconstruction task. Finally, we give a high level description of some algorithms and heuristics for constructing trees from quartets.