5-th phylogenetic root construction for strictly chordal graphs

Authors:
William Kennedy;Guohui Lin
Affiliations:
Algorithmic Research Group and Bioinformatics Research Group, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada;Algorithmic Research Group and Bioinformatics Research Group, Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada
Venue:
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Year:
2005

Citing 6
Cited 6

Computing roots of graphs is hard

Discrete Applied Mathematics
Algorithms for Square Roots of Graphs

SIAM Journal on Discrete Mathematics
Tree powers

Journal of Algorithms
Graph classes: a survey

Graph classes: a survey
Phylogenetic k-Root and Steiner k-Root

ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Strictly chordal graphs are leaf powers

Journal of Discrete Algorithms

On k- Versus (k + 1)-Leaf Powers

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Closest 4-leaf power is fixed-parameter tractable

Discrete Applied Mathematics
The complete inclusion structure of leaf power classes

Theoretical Computer Science
Characterising (k,l)-leaf powers

Discrete Applied Mathematics
The 3-Steiner root problem

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
On (k, l)-leaf powers

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reconstruction of an evolutionary history for a set of organisms is an important research subject in computational biology. One approach motivated by graph theory constructs a relationship graph based on pairwise evolutionary closeness. The approach builds a tree representation equivalent to this graph such that leaves, corresponding to the organisms, are within a specified distance of k in the tree if connected in the relationship graph. This problem, the k-th phylogenetic root construction, has known linear time algorithms for k ≤ 4. However, the computational complexity is unknown when k ≥ 5. We present a polynomial time algorithm for strictly chordal relationship graphs when k = 5.