From quartets to phylogenetic trees

Benny Chor*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationSOFSEM 1998
Subtitle of host publicationTheory and Practice of Informatics - 25th Conference on Current Trends in Theory and Practice of Informatics, Proceedings
EditorsBranislav Rovan
PublisherSpringer Verlag
Number of pages18
ISBN (Print)3540652604, 9783540652601
StatePublished - 1998
Externally publishedYes
Event25th Conference on Theory and Practice of Informatics, SOFSEM 1998 - Jasna, Slovakia
Duration: 21 Nov 199827 Nov 1998

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


Conference25th Conference on Theory and Practice of Informatics, SOFSEM 1998


Dive into the research topics of 'From quartets to phylogenetic trees'. Together they form a unique fingerprint.

Cite this