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.
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