SIMPLE ALGORITHMS FOR PERFECT PHYLOGENY AND TRIANGULATING COLORED GRAPHS

DOI10.1142/S0129054196000038zbMath0853.92011OpenAlexW1988252299MaRDI QIDQ4888365

Richa Agarwala, David Fernández Baca

Publication date: 28 July 1996

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054196000038

zbMATH Keywords

graph coloringevolutionary treescharacter-based methodsperfect phylogeny algorithm

Mathematics Subject Classification ID

Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08)

Related Items (5)

Efficient approximation of convex recolorings ⋮ Mathematical approaches to comparative linguistics ⋮ Convex recolorings of strings and trees: Definitions, hardness results and algorithms ⋮ Minimizing phylogenetic number to find good evolutionary trees ⋮ The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs

This page was built for publication: SIMPLE ALGORITHMS FOR PERFECT PHYLOGENY AND TRIANGULATING COLORED GRAPHS