Abstract
We study parameterized enumeration problems where we are interested in all solutions of limited size, rather than just some minimum solution. In particular, we study the computation of the transversal hypergraph restricted to hyperedges with at most k elements. Then we apply the results and techniques to almost-perfect phylogeny reconstruction in computational biology. We also derive certain concise descriptions of all vertex covers of size at most k in a graph, within less than the trivial time bound.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work has been supported by a grant from the Swedish Research Council (Vetenskapsrådet), file no. 621-2002-4574.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwala, R., Fernández-Baca, D.: A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed. SIAM J. Computing 23, 1216–1224 (1994)
Bodlaender, H., Fellows, M., Warnow, T.: Two strikes against perfect phylogeny. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 273–283. Springer, Heidelberg (1992)
Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L.: Generating dual-bounded hypergraphs, DIMACS Tech. Report 2002-23
Buss, J.F., Goldsmith, J.: Nondeterminism within P. SIAM J. on Computing 22, 560–572 (1993)
Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. J. of Algorithms 41, 280–301 (2001)
Damaschke, P.: Incremental haplotype inference, phylogeny and almost bipartite graphs. In: 2nd RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes 2004, pre-proceedings, Carnegie Mellon Univ., pp. 1–11 (2004)
Downey, R.G.: Parameterized complexity for the skeptic. In: 18th IEEE Conf. on Computational Complexity, pp. 147–170 (2003)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Downey, R.G., Fellows, M.R., Stege, U.: Parameterized complexity, a framework for systematically confronting computational intractability. In: Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Futur. AMSDIMACS Series, vol. 49, pp. 49–99. Springer, Heidelberg (1999)
Fernández-Baca, D., Lagergren, J.: A polynomial-time algorithm for near-perfect phylogeny. In: To appear in SIAM J. Computing, preliminary version in 23rd ICALP 1996 (1996)
Fernau, H.: On parameterized enumeration. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 564–573. Springer, Heidelberg (2002)
Freidman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. of Algorithms 21, 618–628 (1996)
Gramm, J., Niedermeier, R.: Quartet inconsistency is fixed-parameter tractable. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 241–256. Springer, Heidelberg (2001)
Gramm, J., Niedermeier, R.: Breakpoint medians and breakpoint phylogenies: a fixed-parameter approach. In: 1st Europ. Conf. on Comput. Biology 2002, Supplement 2 to Bioinformatics, vol. 18, pp. 128–139 (2002)
Gusfield, D.: Efficient algorithms for inferring evolutionary trees. Networks 21, 19–28 (1991)
Halperin, E., Karp, R.M.: Perfect phylogeny and haplotype inference. In: 8th RECOMB 2004, pp. 10–19 (2004)
Jansson, J.: Consensus algorithms for trees and strings, Dissertation 17, Dept. of Computer Science, Lund Univ. (2003)
Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Info. Proc. Letters 27, 119–123 (1988)
Kannan, S., Warnow, T.: A fast algorithm for the computation and enumeration of perfect phylogenies. SIAM J. Computing 26, 1749–1763 (1997)
Kavvadias, D.J., Stavropoulos, E.C.: A new algorithm for the transversal hypergraph problem. In: Vitter, J.S., Zaroliagis, C.D. (eds.) WAE 1999. LNCS, vol. 1668, pp. 72–84. Springer, Heidelberg (1999)
Niedermeier, R., Rossmanith, P.: Upper bounds for vertex cover further improved. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 561–570. Springer, Heidelberg (1999)
Niedermeier, R., Rossmanith, P.: An efficient fixed parameter algorithm for 3-Hitting Set. J. of Discrete Algorithms 1, 89–102 (2003)
Pe’er, I., Shamir, R., Sharan, R.: Incomplete directed perfect phylogeny. In: Giancarlo, R., Sankoff, D. (eds.) CPM 2000. LNCS, vol. 1848, pp. 143–153. Springer, Heidelberg (2000)
Pe’er, I., Shamir, R., Sharan, R.: On the generality of phylogenies from incomplete directed characters. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol. 2368, pp. 358–367. Springer, Heidelberg (2002)
Steel, M.A.: The complexity of reconstructing trees from qualitative characters and subtrees. J. of Classification 9, 91–116 (1992)
Warnow, T., Ringe, D., Taylor, A.: Reconstructing the evolutionary history of natural languages. In: 7th SODA 1996, pp. 314–322 (1996)
Waterman, M.S.: Introduction to Computational Biology. Chapman and Hall, Boca Raton (1995)
Wernicke, S., Alber, J., Gramm, J., Guo, J., Niedermeier, R.: Avoiding forbidden submatrices by row deletions. In: Van Emde Boas, P., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2004. LNCS, vol. 2932, pp. 349–360. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damaschke, P. (2004). Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction. In: Downey, R., Fellows, M., Dehne, F. (eds) Parameterized and Exact Computation. IWPEC 2004. Lecture Notes in Computer Science, vol 3162. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28639-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-28639-4_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23071-7
Online ISBN: 978-3-540-28639-4
eBook Packages: Springer Book Archive