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

Gerth Stølting Brodal, Rolf Fagerberg, Thomas Mailund, Christian N. S. Pedersen, Andreas Sand. Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. In Sanjeev Khanna, editor, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013. pages 1814-1832, SIAM, 2013. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.