# 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} }

- Published in SODA 2013
DOI:10.1137/1.9781611973105.130

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

## Computing quartet distance is equivalent to counting 4-cycles

VIEW 4 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Algorithms for Computing the Triplet Quartet Distances for Binary General Trees

VIEW 9 EXCERPTS

CITES BACKGROUND & METHODS

HIGHLY INFLUENCED

## Hierarchical Clustering with Structural Constraints

VIEW 1 EXCERPT

CITES METHODS

## PAPER : THE SHAPE OF PHYLOGENETIC TREESPACE

VIEW 2 EXCERPTS

CITES BACKGROUND

## Review Paper: The Shape of Phylogenetic Treespace

VIEW 3 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-9 OF 9 REFERENCES

## Computing the quartet distance between evolutionary trees

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Comparing and Aggregating Partially Resolved Trees

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Comparison of phylogenetic trees

VIEW 1 EXCERPT

#### Similar Papers

Loading similar papers…