On the Scalability of Computing Triplet and Quartet Distances

@inproceedings{Holt2014OnTS,
  title={On the Scalability of Computing Triplet and Quartet Distances},
  author={Morten Kragelund Holt and Jens Johansen and Gerth St{\o}lting Brodal},
  booktitle={ALENEX},
  year={2014}
}
In this paper we present an experimental evaluation of the algorithms by Brodal et al. [SODA 2013] for computing the triplet and quartet distance measures between two leaf labelled rooted and unrooted trees of arbitrary degree, respectively. The algorithms count the number of rooted tree topologies over sets of three leaves (triplets) and unrooted tree topologies over four leaves (quartets), respectively, that have different topologies in the two trees. The algorithms by Brodal et al. maintain… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 16 REFERENCES

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

G. S. Brodal, R. Fagerberg, C.N.S. Pedersen, T. Mailund, A. Sand
  • In Proc. 24th Annual ACM- SIAM Symposium on Discrete Algorithms,
  • 2013
VIEW 10 EXCERPTS
HIGHLY INFLUENTIAL

Similar Papers

Loading similar papers…