Computing Refined Buneman Trees in Cubic Time

Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian Nørgaard Storm Pedersen, and S. Srinivasa Rao

In Proc. 3rd Workshop on Algorithms in BioInformatics, volume 2812 of Lecture Notes in Computer Science, pages 259-270. Springer Verlag, Berlin, 2003.


Reconstructing the evolutionary tree for a set of n species based on pairwise distances between the species is a fundamental problem in bioinformatics. Neighbor joining is a popular distance based tree reconstruction method. It always proposes fully resolved binary trees despite missing evidence in the underlying distance data. Distance based methods based on the theory of Buneman trees and refined Buneman trees avoid this problem by only proposing evolutionary trees whose edges satisfy a number of constraints. These trees might not be fully resolved but there is strong combinatorial evidence for each proposed edge. The currently best algorithm for computing the refined Buneman tree from a given distance measure has a running time of O(n5) and a space consumption of O(n4). In this paper, we present an algorithm with running time O(n3) and space consumption O(n2). The improved complexity of our algorithm makes the method of refined Buneman trees computational competitive to methods based on neighbor joining.

Copyright notice

© Springer-Verlag Berlin Heidelberg 2003. All rights reserved.

Online version

wabi03.pdf (163 Kb)




BIBTEX entry

  author = "Gerth St{\o}lting Brodal and Rolf Fagerberg and Anna \"Ostlin and Christian N{\o}rgaard Storm Pedersen and S. Srinivasa Rao",
  booktitle = "Proc. 3rd Workshop on Algorithms in BioInformatics",
  doi = "10.1007/978-3-540-39763-2_20",
  isbn = "978-3-540-20076-5",
  pages = "259-270",
  publisher = "Springer {V}erlag, Berlin",
  series = "Lecture Notes in Computer Science",
  title = "Computing Refined Buneman Trees in Cubic Time",
  volume = "2812",
  year = "2003"

Other versions