Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree

@inproceedings{Brodal2013EfficientAF,
  title={Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree},
  author={Gerth St{\o}lting Brodal and Rolf Fagerberg and Thomas Mailund and Christian N. S. Pedersen and Andreas Sand},
  booktitle={SODA},
  year={2013}
}
The triplet and quartet distances are distance measures to compare two rooted and two unrooted trees, respectively. The leaves of the two trees should have the same set of n labels. The distances are defined by enumerating all subsets of three labels (triplets) and four labels (quartets), respectively, and counting how often the induced topologies in the two input trees are different. In this paper we present efficient algorithms for computing these distances. We show how to compute the triplet… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-5 OF 5 CITATIONS

Similar Papers

Loading similar papers…