A polynomial time algorithm for constructing the refined Buneman tree

Authors
Bryant, D Moulton, V
Citation
D. Bryant et V. Moulton, A polynomial time algorithm for constructing the refined Buneman tree, APPL MATH L, 12(2), 1999, pp. 51-56
Citations number
13
Categorie Soggetti
Mathematics
Journal title
APPLIED MATHEMATICS LETTERS
ISSN journal
08939659 → ACNP
Volume
12
Issue
2
Year of publication
1999
Pages
51 - 56
Database
ISI
SICI code
0893-9659(199903)12:2<51:APTAFC>2.0.ZU;2-O
Abstract
We present a polynomial time algorithm for computing the refined Buneman tr ee, 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 t hat it is typically more refined. (C) 1998 Elsevier Science Ltd. All rights reserved.