Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction

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

Volumn 4051 LNCS, Issue , 2006, Pages 667-678

  Blelloch, Guy E ^a   Dhamdhere, Kedar ^b   Halperin, Eran ^c   Ravi, R ^d   Schwartz, Russell ^a   Sridhar, Srinath ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b GOOGLE INC   (United States)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^d CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA STRUCTURES; NATURAL SCIENCES COMPUTING; NUMERICAL ANALYSIS; PARAMETER ESTIMATION; TREES (MATHEMATICS);

FIXED PARAMETER TRACTABLE (FPT); PHYLOGENETIC TREE RECONSTRUCTION; PHYLOGENY (EVOLUTIONARY TREE); STEINER MINIMUM TREE;

PROBLEM SOLVING;

EID: 33746337946     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11786986_58     Document Type: Conference Paper

References (22)

1. R. Agarwala and D. Fernandez-Baca. A Polynomial-Time Algorithm for the Perfect Phylogeny Problem when the Number of Character States is Fixed. In SIAM Journal on Computing, 23 (1994).
2. H. Bodlaender, M. Fellows and T. Warnow. Two Strikes Against Perfect Phylogeny. In proc International Colloquium on Automata, Languages and Programming (1992).
3. H. Bodlaender, M. Fellows, M. Hallett, H. Wareham and T. Warnow. The Hardness of Perfect Phylogeny, Feasible Register Assignment and Other Problems on Thin Colored Graphs. In Theoretical Computer Science (2000).
4. M. Bonet, M. Steel, T. Warnow and S. Yooseph. Better Methods for Solving Parsimony and Compatibility, In Journal of Computational Biology, 5(3) (1992).
5. R.G. Downey and M. R. Fellows. Parameterized Complexity. Monographs in Computer Science (1999).
6. W. H. Day and D. Sankoff. Computational Complexity of Inferring Phylogenies by Compatibility. Systematic Zoology (1986).
7. P. Damaschke. Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction. In proc International Workshop on Parameterized and Exact Computation (2004).
8. E. Eskin, E. Halperin and R. M. Karp. Efficient Reconstruction of Haplotype Structure via Perfect Phylogeny. In Journal of Bioinformatics and Computational Biology (2003).
9. D. Fernandez-Baca and J. Lagergren. A Polynomial-Time Algorithm for Near-Perfect Phylogeny. In SIAM Journal on Computing, 32 (2003).
10. L. R. Foulds and R. L. Graham. The Steiner problem in Phylogeny is NP-complete. In Advances in Applied Mathematics (3) (1982).
11. G. Ganapathy, V. Ramachandran and T. Warnow. Better Hill-Climbing Searches for Parsimony. In Workshop on Algorithms in Bioinformatics (2003).
12. D. Gusfield. Efficient Algorithms for Inferring Evolutionary Trees. In Networks, 21 (1991).
13. D. Gusfield. Algorithms on Strings, Trees and Sequences. Cambridge University Press (1999).
14. D. Gusfield and V. Bansal. A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters. In proc Research in Computational Molecular Biology (2005).
15. . D. Gusfield, S. Eddhu and C. Langley. Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination. In Proc IEEE Computer Society Bioinformatics Conference (2003).
16. D. A. Hinds, L. L. Stuve, G. B. Nilsen, E. Halperin, E. Eskin, D. G. Ballinger, K. A. Frazer, D. R. Cox. Whole Genome Patterns of Common DNA Variation in Three Human Populations, www.perlegen.com. In Science (2005).
17. The International HapMap Consortium. The International HapMap Project. wvw.hapmap.org. Nature 426 (2003).
18. S. Kannan and T. Warnow. A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies. In SIAM Journal on Computing, 26 (1997).
19. H. J. Promel and A. Steger. The Steiner Tree Problem: A Tour Through Graphs Algorithms and Complexity. Vieweg Verlag (2002).
20. S. Sridhar, K. Dhamdhere, G. E. Blelloch, E. Halperin, R. Ravi and R. Schwartz. Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees. In proc International Workshop on Bioinformatics Research and Applications (2006).
21. C. Semple and M. Steel. Phylogenetics. Oxford University Press (2003).
22. M. A. Steel. The Complexity of Reconstructing Trees from Qualitative Characters and Subtrees. In J. Classification, 9 (1992).