Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Gerth Stølting Brodal' in GoogleThis author has not been identified. Look up 'Rolf Fagerberg' in GoogleThis author has not been identified. Look up 'Thomas Mailund' in GoogleThis author has not been identified. Look up 'Christian N. S. Pedersen' in GoogleThis author has not been identified. Look up 'Andreas Sand' in Google

runs on WebDSL