Skip to main content
Journal ArticleOPEN ACCESS

A polynomial time algorithm for constructing the refined Buneman tree

Applied Mathematics Letters (1999) 12(2) 51-56
DOI: 10.1016/S0893-9659(98)00148-7
10Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 1998 Elsevier Science Ltd. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Bryant, D., & Moulton, V. (1999). A polynomial time algorithm for constructing the refined Buneman tree. Applied Mathematics Letters, 12(2), 51–56. https://doi.org/10.1016/S0893-9659(98)00148-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free