Phylogenetic k-root and steiner k-root

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1969, Issue , 2000, Pages 539-551

  Lin, Guo Hui ^a,b   Kearney, Paul E ^a   Jiang, Tao ^b,c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b MCMASTER UNIVERSITY   (Canada)

^c University of California ^*  (United States)

Author keywords

Computational biology; Critical clique; Efficient algorithm; Graph power; Graph root; Maximal clique; Phylogeny; Tree power; Tree root

Indexed keywords

BIOINFORMATICS; BIOLOGY; COMPUTATIONAL EFFICIENCY; GRAPH ALGORITHMS;

COMPUTATIONAL BIOLOGY; CRITICAL CLIQUE; GRAPH POWER; GRAPH ROOTS; MAXIMAL CLIQUE; PHYLOGENY; TREE POWER; TREE ROOT;

TREES (MATHEMATICS);

EID: 84949812802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40996-3_46     Document Type: Conference Paper

References (8)

1. A. Brandstadt, V.B. Le, and J.P. Spinrad. Graph classes: a survey. SIAM Monographs on Discrete Mathematics and Applications, 1999.
2. F. Gavril. Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM Journal on Computing, 1:180-187, 1972.
3. P.E. Kearney and D.G. Corneil. Tree powers. Journal of Algorithms, 29:111-131, 1998.
4. Y.-L. Lin and S.S. Skiena. Algorithms for square roots of graphs. SIAM Journal on Discrete Mathematics, 8:99-118, 1995.
5. R. Motwani and M. Sudan. Computing roots of graphs is hard. Discrete Applied Mathematics, 54:81-88, 1994.
6. N. Nishimura, P. Ragde, and D.M. Thilikos. On graph powers for leaf-labeled trees. In Proceedings of the Seventh Scandinavian Workshop on Algorithm Theory (SWAT 2000), 2000. To appear.
7. D.J. Rose, R.E. Tarjan, and G.S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5:266-283, 1976.
8. R.E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing, 13:566-579, 1984.