Abstract
We discuss interdisciplinary parameterized complexity research in biology and cognitive science.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
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.
References
Anderson, J.R.: The Adaptive Character of Thought. Lawrence Erlbaum Associates (1990)
Balasubramanian, R., Fellows, M.R., Raman, V.: An Improved Fixed-Parameter Algorithm for Vertex Cover. Information Processing Letters 65, 163–168 (1998)
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)
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)
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)
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)
Boucher, C.A.: Combinatorial and Probabilistic Approaches to Motif Recognition. PhD thesis, University of Waterloo (2010)
Bryant, D.: Building Trees, Hunting for Trees, and Comparing Trees—Theory and Methods in Phylogenetic Analysis. PhD thesis, University of Canterbury (1997)
Buss, J.F., Goldsmith, J.: Nondeterminism within P. SIAM J. Comput. 22(3), 560–572 (1993)
Carruthers, S., Masson, M., Stege, U.: Human Performance on Hard Non-Euclidean Graph Problems: Vertex Cover. Accepted to the Journal of Problem Solving (2012)
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)
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)
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)
Cherniak, C.: Minimal Rationality. MIT Press (1986)
ClustalXP, http://clustalxp.cgmlab.org/ (retrieved 2012)
Day, W.H.E., Sankoff, D.: Computational Complexity of Inferring Phylogenies by Compatibility. Syst. Zool. 35(2), 224–229 (1986)
Downey, R.G., Fellows, M.R.: Fixed parameter tractability and completeness II: Completeness for W[1]. Theoretical Computer Science A 141, 109–131 (1995)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)
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)
Evans, P.: Algorithms and Complexity for Annotated Sequence Analysis. PhD thesis, University of Victoria (1999)
Fellows, M.R.: On the Complexity of Vertex Set Problems. Technical Report, Computer Science Department, University of New Mexico (1988)
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)
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)
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)
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)
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)
Fellows, M.R., Langston, M.: Nonconstructive Advances in Polynomial Time Complexity. Information Processing Letters 26, 157–162 (1987)
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)
Frixione, M.: Tractable competence. Minds and Machines 11, 379–397 (2001)
Graham, S.M., Joshi, A., Pizlo, Z.: The Traveling Salesman Problem: A Hierarchical Model. Memory & Cognition 28(7), 1191–1204 (2000)
Gramm, J.: Fixed-Parameter Algorithms for the Consensus Analysis of Genomic Data. PhD thesis, Universität Tübingen (2003)
Gramm, J., Nickelsen, A., Tantau, T.: Fixed-Parameter Algorithms in Phylogenetics. The Computer Journal 51(1), 79–101 (2008)
Guo, J.: Algorithm Design Techniques for Parameterized Graph Modification Problems. PhD thesis, Friedrich-Schiller-Universität Jena (2006)
Hallett, M.T.: An Integrated Complexity Analysis of Problems from Computational Biology. PhD thesis, University of Victoria (1996)
Hallett, M., Lagergren, J., Tofigh, A.: Simultaneous Identification of Duplications and Lateral Transfers. In: RECOMB 2004, pp. 47–356 (2004)
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)
Hermelin, D.: New Results in Parameterized Complexity. PhD thesis, University of Haifa (2009)
Hüffner, F.: Algorithm Engineering for Optimal Graph Bipartization. Journal of Graph Algorithms and Applications 13(2), 77–98 (2009)
Hüffner, F., Niedermeier, R., Wernicke, S.: Developing Fixed-Parameter Algorithms to Solve Combinatorially Explosive Biological Problems. Bioinformatics, 395–421 (2007)
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)
Kwisthout, J., Wareham, T., van Rooij, I.: Bayesian Intractability is not an Ailment that Approximation Can Cure. Cognitive Science 35(5), 779–784 (2011)
Langston, M.A.: Homepage, http://web.eecs.utk.edu/~langston/ (retrieved 2012)
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)
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)
Levesque, H.J.: Logic and the complexity of reasoning. Journal of Philosophical Logic 17, 355–389 (1988)
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)
Mahajan, M., Raman, V., Sikdar, S.: Parameterizing Above or Below Guaranteed Values. J. Comput. Syst. Sci. 75(2), 137–153 (2009)
Marr, D.: Vision: A Computational Investigation into the Human Representation and Processing Visual Information. W.H. Freeman (1982)
Martignon, L., Hoffrage, U.: Fast, Frugal, and Fit: Simple Heuristics for Paired Comparison. Theory and Decision 52, 29–71 (2002)
Martignon, L., Schmitt, M.: Simplicity and Robustness of Fast and Frugal Heuristics. Minds and Machines 9, 565–593 (1999)
Mehlhorn, K.: Data Structures and Efficient Algorithms. Graph Algorithms and NP-Completeness, vol. 2. Springer (1984)
Millgram, E.: Coherence: The Price of the Ticket. Journal of Philosophy 97, 82–93 (2000)
Niedermeier, R.: Reflections on Multivariate Algorithmics and Problem Parameterization. In: STACS 2010, pp. 17–32 (2010)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press (2006)
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)
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)
Oaksford, M., Chater, N.: Rationality in an uncertain world: Essays on the cognitive science of human reasoning. Psychology Press, Hove (1993)
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)
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)
Prince, A., Smolensky, P.: Optimality Theory Constraint Interaction in Generative Grammar. Tech. Rep. RuCCS TR-2, Center for Cognitive Science, Rutgers University (1993)
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)
Roth-Korostensky, C.: Algorithms for Building Multiple Sequence Alignments and Evolutionary Trees. PhD thesis, ETH Zürich (2000)
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)
Shaw, P.: Advances in Cluster Editing: Linear FPT Kernels and Comparative Implementations. PhD thesis, The University of Newcastle (2010)
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)
Simon, H.A.: Invariants of human behavior. Annual Review of Psychology 41(1), 1–19 (1990)
Snir, S.: Computational Issues in Phylogenetic Reconstruction: Analytic Maximum Likelihood Solutions, and Convex Recoloring. PhD thesis, Technion (2004)
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)
Stege, U.: Resolving Conflicts from Computational Biology. PhD thesis, ETH Zürich (2000)
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)
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)
Thagard, P.: Coherence in Thought and Action. MIT Press (2000)
Tsotsos, J.K.: Analyzing Vision at the Complexity Level. Behavioral and Brain Sciences 13(3), 423–469 (1990)
Rooij, I.: Self-Organization Takes Time too. Topics in Cognitive Science 4, 63–71 (2012)
van Rooij, I.: The tractable Cognition Thesis. Cognitive Science (2008)
van Rooij, I.: Tractable Cognition: Complexity Theory in Cognitive Psychology. Ph.D. Thesis, Department of Psychology, University of Victoria (2003)
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)
van Rooij, I., Stege, U., Kadlec, H.: Sources of Complexity in Subset Choice. Journal of Mathematical Psychology 49(2), 160–187 (2005)
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)
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)
Wareham, H.T.: Systematic Parameterized Complexity Analysis in Computational Phonology. Ph.D. Thesis, Department of Computer Science, University of Victoria (1999)
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)
Whewell, W.: History of the Inductive Sciences, from the Earliest to the Present Times, London, vol. 3 (1837)
Whewell, W.: The Philosophy of the Inductive Sciences, founded upon their history, London, vol. 2 (1840)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)