Computing Refined Buneman Trees in Cubic Time 1st Edition by Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian Pedersen, Srinivasa Rao 9783540200765

Computing Refined Buneman Trees in Cubic Time 1st Edition by Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian Pedersen, Srinivasa Rao – Ebook PDF Instant Download/Delivery. 9783540200765

Full download Computing Refined Buneman Trees in Cubic Time 1st Edition after payment

Product details:

ISBN 13: 9783540200765

Author: Gerth Stølting Brodal, Rolf Fagerberg, Anna Östlin, Christian N.S. Pedersen; S. Srinivasa Rao

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(n ⁵) and a space consumption of O(n ⁴). In this paper, we present an algorithm with running time O(n ³) and space consumption O(n ²). The improved complexity of our algorithm makes the method of refined Buneman trees computational competitive to methods based on neighbor joining.

Computing Refined Buneman Trees in Cubic Time 1st Table of contents:

1 Introduction
2 Preliminaries

3 Maintaining a set of compatible splits

4 Computing refined Buneman trees

5 Refined Buneman indexes

People also search for Computing Refined Buneman Trees in Cubic Time 1st: 

computes all possible binary trees which have exactly two leaves

cubic time algorithm

cubic time complexity

 r-tree time complexity