Title of article
A polynomial time algorithm for constructing the refined Buneman tree Original Research Article
Author/Authors
D. Bryant، نويسنده , , J. H. Koolen and V. Moulton، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
6
From page
51
To page
56
Abstract
We present a polynomial time algorithm for computing the refined Buneman tree, thereby making it applicable for tree reconstruction on large data sets. The refined Buneman tree retains many of the desirable properties of its predecessor, the well-known Buneman tree, but has the practical advantage that it is typically more refined.
Keywords
Weighted trees , Refined Buneman tree , Phylogenetics , Distance-based tree reconstruction , Buneman tree
Journal title
Applied Mathematics Letters
Serial Year
1999
Journal title
Applied Mathematics Letters
Record number
896762
Link To Document