Skip to main content
SpringerLink
Log in

The Impact of Parameterized Complexity to Interdisciplinary Problem Solving

  • Chapter
The Multivariate Algorithmic Revolution and Beyond

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7370))

Abstract

We discuss interdisciplinary parameterized complexity research in biology and cognitive science.

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

Access this chapter

Log in via an institution
eBook
USD 16.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. Anderson, J.R.: The Adaptive Character of Thought. Lawrence Erlbaum Associates (1990)

    Google Scholar 

  2. Balasubramanian, R., Fellows, M.R., Raman, V.: An Improved Fixed-Parameter Algorithm for Vertex Cover. Information Processing Letters 65, 163–168 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bansal, M.S., Shamir, R.: A Note on the Fixed Parameter Tractability of the Gene-Duplication Problem. IEEE/ACM Trans. Comput. Biol. Bioinformatics 8(3), 848–850 (2011)

    Article  Google Scholar 

  4. Betzler, N., van Bevern, R., Komusiewicz, C., Fellows, M.R., Niedermeier, R.: Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics 8(5), 1296–1308 (2011)

    Article  Google Scholar 

  5. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hallett, M.T., Wareham, H.T.: Parameterized Complexity Analysis in Computational Biology. Computer Applications in the Biosciences 11(2), 49–57 (1995)

    Google Scholar 

  6. Bodlaender, H.L., Fellows, M.R., Warnow, T.J.: Two Strikes Against Perfect Phylogeny. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 273–283. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  7. Boucher, C.A.: Combinatorial and Probabilistic Approaches to Motif Recognition. PhD thesis, University of Waterloo (2010)

    Google Scholar 

  8. Bryant, D.: Building Trees, Hunting for Trees, and Comparing Trees—Theory and Methods in Phylogenetic Analysis. PhD thesis, University of Canterbury (1997)

    Google Scholar 

  9. Buss, J.F., Goldsmith, J.: Nondeterminism within P. SIAM J. Comput. 22(3), 560–572 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  10. Carruthers, S., Masson, M., Stege, U.: Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover. Accepted to the Journal of Problem Solving (2012)

    Google Scholar 

  11. Cheetham, J., Dehne, F., Rau-Chaplin, A., Stege, U., Taillon, P.J.: Solving Large FPT Problems on Coarse Grained Parallel Machines. Journal of Computer and System Sciences 67(4), 691–706 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  12. Chen, J., Kanj, I.A., Jia, W.: Vertex Cover: Further Observations and Further Improvements. In: Widmayer, P., Neyer, G., Eidenbenz, S. (eds.) WG 1999. LNCS, vol. 1665, pp. 313–324. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  13. Chen, J., Kanj, I.A., Xia, G.: Improved Parameterized Upper Bounds for Vertex Cover. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 238–249. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  14. Cherniak, C.: Minimal Rationality. MIT Press (1986)

    Google Scholar 

  15. ClustalXP, http://clustalxp.cgmlab.org/ (retrieved 2012)

  16. Day, W.H.E., Sankoff, D.: Computational Complexity of Inferring Phylogenies by Compatibility. Syst. Zool. 35(2), 224–229 (1986)

    MATH  Google Scholar 

  17. Downey, R.G., Fellows, M.R.: Fixed parameter tractability and completeness II: Completeness for W[1]. Theoretical Computer Science A 141, 109–131 (1995)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  19. Downey, R.G., Fellows, M.R., Stege, U.: Parameterized Complexity: a Framework for Systematically Confronting Computational Intractability. In: Graham, R., Kratochvil, J., Nesetril, J., Roberts, F. (eds.) Proc. DIMACS-DIMATIA Workshop, Prague. Contemporary Trends in Discrete Mathematics (1997), AMS-DIMACS Series in Discrete Mathematics and Theoretical Computer Science 49, 49–99 (1999)

    Google Scholar 

  20. Evans, P.: Algorithms and Complexity for Annotated Sequence Analysis. PhD thesis, University of Victoria (1999)

    Google Scholar 

  21. Fellows, M.R.: On the Complexity of Vertex Set Problems. Technical Report, Computer Science Department, University of New Mexico (1988)

    Google Scholar 

  22. Fellows, M.R., Gaspers, S., Rosamond, F.: Multivariate Complexity Theory. In: Blum, E.K., Aho, A.V. (eds.) Computer Science, pp. 269–293. Springer, New York (2011)

    Chapter  Google Scholar 

  23. Fellows, M.R., Hallett, M.T., Korostensky, C., Stege, U.: Analogs and Duals of the MAST Problem for Sequences and Trees. In: Bilardi, G., Pietracaprina, A., Italiano, G.F., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 103–114. Springer, Heidelberg (1998)

    Google Scholar 

  24. Fellows, M.R., Hallett, M.T., Stege, U.: Analogs and Duals of the MAST Problem for Sequences and Trees. Journal of Algorithms 49(1), 192–216 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  25. Fellows, M.R., Hallett, M.T., Stege, U.: On the Multiple Gene Duplication Problem. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 347–357. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  26. Fellows, M.R., Hallett, M.T., Wareham, H.T.: DNA Physical Mapping: Three Ways Difficult. In: Lengauer, T. (ed.) ESA 1993. LNCS, vol. 726, pp. 157–168. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  27. Fellows, M.R., Langston, M.: Nonconstructive Advances in Polynomial Time Complexity. Information Processing Letters 26, 157–162 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  28. Fellows, M.R., McCartin, C., Rosamond, F.A., Stege, U.: Coordinatized kernels and Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 240–251. Springer, Heidelberg (2000)

    Google Scholar 

  29. Frixione, M.: Tractable competence. Minds and Machines 11, 379–397 (2001)

    Article  MATH  Google Scholar 

  30. Graham, S.M., Joshi, A., Pizlo, Z.: The Traveling Salesman Problem: A Hierarchical Model. Memory & Cognition 28(7), 1191–1204 (2000)

    Article  Google Scholar 

  31. Gramm, J.: Fixed-Parameter Algorithms for the Consensus Analysis of Genomic Data. PhD thesis, Universität Tübingen (2003)

    Google Scholar 

  32. Gramm, J., Nickelsen, A., Tantau, T.: Fixed-Parameter Algorithms in Phylogenetics. The Computer Journal 51(1), 79–101 (2008)

    Article  Google Scholar 

  33. Guo, J.: Algorithm Design Techniques for Parameterized Graph Modification Problems. PhD thesis, Friedrich-Schiller-Universität Jena (2006)

    Google Scholar 

  34. Hallett, M.T.: An Integrated Complexity Analysis of Problems from Computational Biology. PhD thesis, University of Victoria (1996)

    Google Scholar 

  35. Hallett, M., Lagergren, J., Tofigh, A.: Simultaneous Identification of Duplications and Lateral Transfers. In: RECOMB 2004, pp. 47–356 (2004)

    Google Scholar 

  36. Helwig, S., Hüffner, F., Rössling, I., Weinard, M.: Chapter 3. Selected Design Issues. In: Müller-Hannemann, M., Schirra, S. (eds.) Algorithm Engineering. LNCS, vol. 5971, pp. 58–126. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  37. Hermelin, D.: New Results in Parameterized Complexity. PhD thesis, University of Haifa (2009)

    Google Scholar 

  38. Hüffner, F.: Algorithm Engineering for Optimal Graph Bipartization. Journal of Graph Algorithms and Applications 13(2), 77–98 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  39. Hüffner, F., Niedermeier, R., Wernicke, S.: Developing Fixed-Parameter Algorithms to Solve Combinatorially Explosive Biological Problems. Bioinformatics, 395–421 (2007)

    Google Scholar 

  40. Hüffner, F., Niedermeier, R., Wernicke, S.: Fixed-parameter algorithms for graph-modeled data clustering. In: Clustering Challenges in Biological Networks, pp. 3–28. World Scientific (2009)

    Google Scholar 

  41. Kwisthout, J., Wareham, T., van Rooij, I.: Bayesian Intractability is not an Ailment that Approximation Can Cure. Cognitive Science 35(5), 779–784 (2011)

    Article  Google Scholar 

  42. Langston, M.A.: Homepage, http://web.eecs.utk.edu/~langston/ (retrieved 2012)

  43. Langston, M.A., Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Suters, W.H., Symons, C.T.: Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments. In: ALENEX 2004, pp. 62–69 (2004)

    Google Scholar 

  44. Langston, M.A., Abu-Khzam, F.N., Shanbhag, P.: Scalable Parallel Algorithms for Difficult Combinatorial Problems: a Case Study in Optimization. In: PDCS 2003, pp. 649–654 (2003)

    Google Scholar 

  45. Levesque, H.J.: Logic and the complexity of reasoning. Journal of Philosophical Logic 17, 355–389 (1988)

    Article  MathSciNet  Google Scholar 

  46. MacGregor, J.N., Ormerod, T.C., Chronicle, E.P.: A Model of Human Performance on the Traveling Salesperson Problem. Memory & Cognition 28(7), 1183–1190 (2000)

    Article  Google Scholar 

  47. Mahajan, M., Raman, V., Sikdar, S.: Parameterizing Above or Below Guaranteed Values. J. Comput. Syst. Sci. 75(2), 137–153 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  48. Marr, D.: Vision: A Computational Investigation into the Human Representation and Processing Visual Information. W.H. Freeman (1982)

    Google Scholar 

  49. Martignon, L., Hoffrage, U.: Fast, Frugal, and Fit: Simple Heuristics for Paired Comparison. Theory and Decision 52, 29–71 (2002)

    Article  MATH  Google Scholar 

  50. Martignon, L., Schmitt, M.: Simplicity and Robustness of Fast and Frugal Heuristics. Minds and Machines 9, 565–593 (1999)

    Article  Google Scholar 

  51. Mehlhorn, K.: Data Structures and Efficient Algorithms. Graph Algorithms and NP-Completeness, vol. 2. Springer (1984)

    Google Scholar 

  52. Millgram, E.: Coherence: The Price of the Ticket. Journal of Philosophy 97, 82–93 (2000)

    Google Scholar 

  53. Niedermeier, R.: Reflections on Multivariate Algorithmics and Problem Parameterization. In: STACS 2010, pp. 17–32 (2010)

    Google Scholar 

  54. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)

    Google Scholar 

  55. 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 

  56. Oaksford, M., Chater, N.: Reasoning Theories and Bounded Tationality. In: Manktelow, K.I., Over, D.E. (eds.) Rationality: Psychological and Philosophical Perspectives, pp. 31–60 (1998)

    Google Scholar 

  57. Oaksford, M., Chater, N.: Rationality in an uncertain world: Essays on the cognitive science of human reasoning. Psychology Press, Hove (1993)

    Google Scholar 

  58. Papadimitriou, C.H., Yannakakis, M.: On limited nondeterminism and the complexity of the V-C dimension. Journal of Computer and System Sciences 53(2), 161–170 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  59. Parberry, I.: Knowledge, Understanding, and Computational Complexity. In: Levine, D.S., Elsberry, W.R. (eds.) Optimality in Biological and Artificial Networks?, pp. 125–144. Lawrence Erlbaum Publishers, Hillsdale (1997)

    Google Scholar 

  60. Prince, A., Smolensky, P.: Optimality Theory Constraint Interaction in Generative Grammar. Tech. Rep. RuCCS TR-2, Center for Cognitive Science, Rutgers University (1993)

    Google Scholar 

  61. Rensink, R.A., Provan, G.: The Analysis of Resource-Limited Vision Systems. In: Proceedings of the 13th Annual Conference of the Cognitive Science Society, pp. 311–316 (1991)

    Google Scholar 

  62. Roth-Korostensky, C.: Algorithms for Building Multiple Sequence Alignments and Evolutionary Trees. PhD thesis, ETH Zürich (2000)

    Google Scholar 

  63. Scobbie, J.M.: Towards Declarative Phonology. In: Bird, S. (ed.) Declarative Perspectives in Phonology. Edinburgh Working Papers in Cognitive Science, vol. 7, pp. 1–27. University of Ediburgh (1992)

    Google Scholar 

  64. Shaw, P.: Advances in Cluster Editing: Linear FPT Kernels and Comparative Implementations. PhD thesis, The University of Newcastle (2010)

    Google Scholar 

  65. Simon, H.A.: Rationality as Process and as Product of Thought. In: Bell, D.E., Raiffa, H., Tversky, A. (eds.) Decision Making: Descriptive, Normative, and Prescriptive Interactions, pp. 58–77. Cambridge University Press, Cambridge (1988)

    Chapter  Google Scholar 

  66. Simon, H.A.: Invariants of human behavior. Annual Review of Psychology 41(1), 1–19 (1990)

    Article  Google Scholar 

  67. Snir, S.: Computational Issues in Phylogenetic Reconstruction: Analytic Maximum Likelihood Solutions, and Convex Recoloring. PhD thesis, Technion (2004)

    Google Scholar 

  68. Stege, U.: Gene Trees and Species Trees: The Gene-Duplication Problem is Fixed-Parameter Tractable. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 288–293. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  69. Stege, U.: Resolving Conflicts from Computational Biology. PhD thesis, ETH Zürich (2000)

    Google Scholar 

  70. Stege, U., Fellows, M.R.: An Improved Fixed-Parameter Tractable Algorithm for Vertex Cover. Technical Report 318, Department of Computer Science, ETH Zürich (April 1999)

    Google Scholar 

  71. Stege, U., van Rooij, I., Hertel, A., Hertel, P.: An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 249–261. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  72. Thagard, P.: Coherence in Thought and Action. MIT Press (2000)

    Google Scholar 

  73. Tsotsos, J.K.: Analyzing Vision at the Complexity Level. Behavioral and Brain Sciences 13(3), 423–469 (1990)

    Article  Google Scholar 

  74. Rooij, I.: Self-Organization Takes Time too. Topics in Cognitive Science 4, 63–71 (2012)

    Article  Google Scholar 

  75. van Rooij, I.: The tractable Cognition Thesis. Cognitive Science (2008)

    Google Scholar 

  76. van Rooij, I.: Tractable Cognition: Complexity Theory in Cognitive Psychology. Ph.D. Thesis, Department of Psychology, University of Victoria (2003)

    Google Scholar 

  77. van Rooij, I., Schactman, A., Kadlec, H., Stege, U.: Perceptual or Analytical Processing? Evidence from Children’s and Adult’s Performance on the Euclidean Traveling Salesman Problem. Journal of Problem Solving 1(1), 44–73 (2006)

    Google Scholar 

  78. van Rooij, I., Stege, U., Kadlec, H.: Sources of Complexity in Subset Choice. Journal of Mathematical Psychology 49(2), 160–187 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  79. van Rooij, I., Stege, U., Schactman: Convex hull and Tour Crossings in the Euclidean Traveling Salesperson Problem: Implications for Human Performance Studies. Memory & Cognition 31(2), 215–220 (2003)

    Article  Google Scholar 

  80. Wareham, H.T.: The role of Parameterized Computational Complexity Theory in Cognitive Modeling. In: AAAI 1996 Workshop Working Notes: Computational Cognitive Modeling: Source of the Power (1996)

    Google Scholar 

  81. Wareham, H.T.: Systematic Parameterized Complexity Analysis in Computational Phonology. Ph.D. Thesis, Department of Computer Science, University of Victoria (1999)

    Google Scholar 

  82. Wareham, H.T., Evans, P., van Rooij, I.: What does (and doesn’t) make analogical problem solving easy? Journal of Problem Solving 3(2), 30–71 (2011)

    Article  Google Scholar 

  83. Whewell, W.: History of the Inductive Sciences, from the Earliest to the Present Times, London, vol. 3 (1837)

    Google Scholar 

  84. Whewell, W.: The Philosophy of the Inductive Sciences, founded upon their history, London, vol. 2 (1840)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Victoria, Canada

    Ulrike Stege

Authors
  1. Ulrike Stege
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB, Utrecht, The Netherlands

    Hans L. Bodlaender

  2. School of Mathematics, Statistics and Operations Research, Victoria University, P.O. Box 600, Wellington, New Zealand

    Rod Downey

  3. Institute of Informatics, University of Bergen, Postboks 7800, 5020, Bergen, Norway

    Fedor V. Fomin

  4. Computer and Automation Research Institute, Hungarian Academy of Sciences (MTA SZTAKI), Pf. 63, 1518, Budapest, Hungary

    Dániel Marx

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Stege, U. (2012). The Impact of Parameterized Complexity to Interdisciplinary Problem Solving. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds) The Multivariate Algorithmic Revolution and Beyond. Lecture Notes in Computer Science, vol 7370. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30891-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30891-8_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30890-1

  • Online ISBN: 978-3-642-30891-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation