Parameterized enumeration, transversals, and imperfect phylogeny reconstruction

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

Volumn 3162, Issue , 2004, Pages 1-12

  Damaschke, Peter ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGY;

ALL SOLUTIONS; COMPUTATIONAL BIOLOGY; ENUMERATION PROBLEMS; MINIMUM SOLUTION; PARAMETERIZED; PERFECT PHYLOGENY; PHYLOGENY RECONSTRUCTION; VERTEX COVER;

PARAMETERIZATION;

EID: 36649023966     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28639-4_1     Document Type: Conference Paper

References (28)

1. R. Agarwala, D. Fernández-Baca: A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed, SIAM J. Computing 23 (1994), 1216-1224
2. H. Bodlaender, M. Fellows, T. Warnow: Two strikes against perfect phylogeny, 19th ICALP’92, 273-283
3. E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan: Generating dual-bounded hypergraphs, DIMACS Tech. Report 2002-23
4. J.F. Buss, J. Goldsmith: Nondeterminism within P, SIAM J. on Computing 22 (1993), 560-572
5. J. Chen, I.A. Kanj, W. Jia: Vertex cover: further observations and further improvements, J. of Algorithms 41 (2001), 280-301
6. P. Damaschke: Incremental haplotype inference, phylogeny and almost bipartite graphs, 2nd RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes 2004, pre-proceedings, Carnegie Mellon Univ., 1-11
7. R.G. Downey: Parameterized complexity for the skeptic, 18th IEEE Conf. on Computational Complexity 2003, 147-170
8. R.G. Downey, M.R. Fellows: Parameterized Complexity, Springer 1999
9. R.G. Downey, M.R. Fellows, U. Stege: Parameterized complexity, a framework for systematically confronting computational intractability, in: Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, AMSDIMACS Series 49 (1999), 49-99 Springer 1999
10. D. Fernández-Baca, J. Lagergren: A polynomial-time algorithm for near-perfect phylogeny, to appear in SIAM J. Computing, preliminary version in 23rd ICALP’96
11. H. Fernau: On parameterized enumeration, COCOON’2002, LNCS 2387, 564-573
12. M.L. Freidman, L. Khachiyan: On the complexity of dualization of monotone disjunctive normal forms, J. of Algorithms 21 (1996), 618-628
13. J. Gramm, R. Niedermeier: Quartet inconsistency is fixed-parameter tractable, 12th CPM’2001, LNCS 2089, 241-256
14. J. Gramm, R. Niedermeier: Breakpoint medians and breakpoint phylogenies: a fixed-parameter approach, 1st Europ. Conf. on Comput. Biology 2002, Supplement 2 to Bioinformatics 18, 128-139
15. D. Gusfield: Efficient algorithms for inferring evolutionary trees, Networks 21 (1991), 19-28
16. E. Halperin, R.M. Karp: Perfect phylogeny and haplotype inference, 8th RECOMB’ 2004, 10-19
17. J. Jansson: Consensus algorithms for trees and strings, Dissertation 17, Dept. of Computer Science, Lund Univ. 2003
18. D.S. Johnson, M. Yannakakis, C.H. Papadimitriou: On generating all maximal independent sets, Info. Proc. Letters 27 (1988), 119-123
19. S. Kannan, T. Warnow: A fast algorithm for the computation and enumeration of perfect phylogenies, SIAM J. Computing 26 (1997), 1749-1763
20. D.J. Kavvadias, E.C. Stavropoulos: A new algorithm for the transversal hypergraph problem, WAE’99, LNCS 1668, 72-84
21. R. Niedermeier, P. Rossmanith: Upper bounds for vertex cover further improved, 16th STACS’99, LNCS 1563, 561-570
22. R. Niedermeier, P. Rossmanith: An efficient fixed parameter algorithm for 3-Hitting Set, J. of Discrete Algorithms 1 (2003), 89-102
23. I. Pe’er, R. Shamir, R. Sharan: Incomplete directed perfect phylogeny, 11th CPM’2000, LNCS 1848, 143-153
24. I. Pe’er, R. Shamir, R. Sharan: On the generality of phylogenies from incomplete directed characters, 8th SWAT’2002, LNCS 2368, 358-367
25. M.A. Steel: The complexity of reconstructing trees from qualitative characters and subtrees, J. of Classification 9 (1992), 91-116
26. T. Warnow, D. Ringe, A. Taylor: Reconstructing the evolutionary history of natural languages, 7th SODA’96, 314-322
27. M.S. Waterman: Introduction to Computational Biology, Chapman and Hall 1995
28. S. Wernicke, J. Alber, J. Gramm, J. Guo, R. Niedermeier: Avoiding forbidden submatrices by row deletions, 30th SOFSEM’2004, LNCS 2932, 349-360