Skip to main content
SpringerLink
Log in

Parameterized Enumeration, Transversals, and Imperfect Phylogeny Reconstruction

  • Conference paper
Parameterized and Exact Computation (IWPEC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3162))

Included in the following conference series:

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.

This work has been supported by a grant from the Swedish Research Council (Vetenskapsrådet), file no. 621-2002-4574.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Article  MATH  Google Scholar 

  2. 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)

    Google Scholar 

  3. Boros, E., Elbassioni, K., Gurvich, V., Khachiyan, L.: Generating dual-bounded hypergraphs, DIMACS Tech. Report 2002-23

    Google Scholar 

  4. Buss, J.F., Goldsmith, J.: Nondeterminism within P. SIAM J. on Computing 22, 560–572 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. J. of Algorithms 41, 280–301 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. 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)

    Google Scholar 

  7. Downey, R.G.: Parameterized complexity for the skeptic. In: 18th IEEE Conf. on Computational Complexity, pp. 147–170 (2003)

    Google Scholar 

  8. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)

    Google Scholar 

  9. 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)

    Google Scholar 

  10. 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)

    Google Scholar 

  11. Fernau, H.: On parameterized enumeration. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 564–573. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  12. Freidman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. of Algorithms 21, 618–628 (1996)

    Article  Google Scholar 

  13. 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)

    Chapter  Google Scholar 

  14. 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)

    Google Scholar 

  15. Gusfield, D.: Efficient algorithms for inferring evolutionary trees. Networks 21, 19–28 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  16. Halperin, E., Karp, R.M.: Perfect phylogeny and haplotype inference. In: 8th RECOMB 2004, pp. 10–19 (2004)

    Google Scholar 

  17. Jansson, J.: Consensus algorithms for trees and strings, Dissertation 17, Dept. of Computer Science, Lund Univ. (2003)

    Google Scholar 

  18. Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Info. Proc. Letters 27, 119–123 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  19. Kannan, S., Warnow, T.: A fast algorithm for the computation and enumeration of perfect phylogenies. SIAM J. Computing 26, 1749–1763 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  20. 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)

    Chapter  Google Scholar 

  21. 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)

    Chapter  Google Scholar 

  22. Niedermeier, R., Rossmanith, P.: An efficient fixed parameter algorithm for 3-Hitting Set. J. of Discrete Algorithms 1, 89–102 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  23. 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)

    Chapter  Google Scholar 

  24. 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)

    Chapter  Google Scholar 

  25. Steel, M.A.: The complexity of reconstructing trees from qualitative characters and subtrees. J. of Classification 9, 91–116 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  26. Warnow, T., Ringe, D., Taylor, A.: Reconstructing the evolutionary history of natural languages. In: 7th SODA 1996, pp. 314–322 (1996)

    Google Scholar 

  27. Waterman, M.S.: Introduction to Computational Biology. Chapman and Hall, Boca Raton (1995)

    MATH  Google Scholar 

  28. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Engineering, Chalmers University, 41296, Göteborg, Sweden

    Peter Damaschke

Authors
  1. Peter Damaschke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Mathematics, Statistics, and Computer Science, Victoria University, PO Box 600, Wellington, New Zealand

    Rod Downey

  2. PCRU, Office of DVC (Research), University of Newcastle, Australia

    Michael Fellows

  3. Carleton University, Ottawa, Canada

    Frank Dehne

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation