The PHYLOGENETIC kTH ROOT PROBLEM (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V,E) such that (1) T has no degree-2 internal nodes, (2) the external nodes (i.e. leaves) of T are exactly the elements of V, and (3) (u,v) ∈ E if and only if the distance between u and v in tree T is at most k, where k is some fixed threshold k. Such a tree T, if exists, is called a phylogenetic kth root of graph G. The computational complexity of PRk is open, except for k ≤ 4. Recently, Chen et al. investigated PRk under a natural restriction that the maximum degree of the phylogenetic root is bounded from above by a constant. They presented a linear-time algorithm that determines if a given connected G has such a phylogenetic kth root, and if so, demonstrates one. In this paper, we supplement their work by presenting a linear-time algorithm for disconnected graphs. © Springer-Verlag 2004.
CITATION STYLE
Chen, Z. Z., & Tsukiji, T. (2004). Computing bounded-degree phylogenetic roots of disconnected graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3353, 308–319. https://doi.org/10.1007/978-3-540-30559-0_26
Mendeley helps you to discover research relevant for your work.