Constructing perfect phylogenies and proper triangulations for three-state characters

Authors:
Rob Gysel;Fumei Lam;Dan Gusfield
Affiliations:
Department of Computer Science, University of California, Davis, Davis, CA;Department of Computer Science, University of California, Davis, Davis, CA;Department of Computer Science, University of California, Davis, Davis, CA
Venue:
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Year:
2011

Citing 11
Cited 1

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs

Information Processing Letters
Inferring Evolutionary History from DNA Sequences

SIAM Journal on Computing
A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed

SIAM Journal on Computing
A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies

SIAM Journal on Computing
Characterizations and algorithmic applications of chordal graph embeddings

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
How to Use the Minimal Separators of a Graph for its Chordal Triangulation

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Two Strikes Against Perfect Phylogeny

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
The Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via Integer-Programming and Chordal Graph Theory

RECOMB 2'09 Proceedings of the 13th Annual International Conference on Research in Computational Molecular Biology
A wide-range algorithm for minimal triangulation from an arbitrary ordering

Journal of Algorithms

Reducing problems in unrooted tree compatibility to restricted triangulations of intersection graphs

WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the problem of constructing perfect phylogenies for three-state characters. Our work builds on two recent results. The first result states that for three-state characters, the local condition of examining all subsets of three characters is sufficient to determine the global property of admitting a perfect phylogeny. The second result applies tools from minimal triangulation theory to the partition intersection graph to determine if a perfect phylogeny exists. Despite the wealth of combinatorial tools and algorithms stemming from the chordal graph and minimal triangulation literature, it is unclear how to use such approaches efficiently to construct a perfect phylogeny for three-state characters when the data admits one. We utilize structural properties of both the partition intersection graph and the original data in order to achieve a competitive time bound.