A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Computing phylogenetic roots with bounded degrees and errors is NP-complete

2006
*
Theoretical Computer Science
*

In this paper we study the computational complexity of the following optimization problem: given a graph G = (V , E), we wish to find a tree T such that (1) the degree of each internal node of T is at least 3 and at most , (2) the leaves of T are exactly the elements of V, and (3) the number of errors, that is, the symmetric difference between E and {{u, v} : u, v are leaves of T and d T (u, v) k}, is as small as possible, where d T (u, v) denotes the distance between u and v in tree T. We show

doi:10.1016/j.tcs.2006.06.016
fatcat:5bga3s3wkvdxvetl6ifahwq7fe