Bioinformatics: Problem solving paradigms

Bioinformatics: Problem Solving Paradigms

Volumn , Issue , 2007, Pages 1-289

  Sperschneider, Volker ^a   Scheubert, Lena ^a   Sperschneider, Jana ^b  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

^b UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84892351308     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-540-78506-4     Document Type: Book

References (81)

1. Eric L. Anson and Eugene W. Myers. Algorithms for whole genome shotgun sequencing. In RECOMB, pages 1-9, 1999.
2. Sanjeev Arora and Shmuel Safra. Probabilistic Checking of Proofs: A New Characterization of NP. In 33rd Annual Symposium on Foundations of Computer Science, pages 2-12. IEEE, 1992.
3. Vineet Bafna, Eugene L. Lawler, and Pavel A. Pevzner. Approximation Algorithms for Multiple Sequence Alignment. Theor. Comput. Sci., 182 (1-2):233-244, 1997.
4. Pierre Baldi and Søren Brunak. Bioinformatics: The Machine Learning Approach (Adaptive Computation and Machine Learning). The MIT Press, 1998.
5. Pierre Baldi, Søren Brunak, Yves Chauvin, Jacob Engelbrecht, and Anders Krogh. Hidden markov models for human genes. In NIPS, pages 761-768, 1993.
6. Pierre Baldi, Søren Brunak, Yves Chauvin, Jacob Engelbrecht, and Anders Krogh. Periodic sequence patterns in human exons. In ISMB, pages 30-38, 1995.
7. Pierre Baldi and Yves Chauvin. Hidden Markov Models of the G-Protein-Coupled Receptor Family. Journal of Computational Biology, 1(4):311-336, 1994.
8. Richard Bellman. Dynamic Programming. Princeton University Press, 1957.
9. Richard Bellman. Dynamic Programming. Dover Publications Inc., 2003.
10. Kristin P. Bennett and Ayhan Demiriz. Semi-supervised support vector machines. In NIPS, pages 368-374, 1998.
11. Bonnie Berger and Frank Thomson Leighton. Protein folding in the hydrophobic-hydrophilic (P) is NP-complete. In RECOMB, pages 30-39, 1998.
12. C. M. Bishop and Geoffrey Hinton. Neural Networks for Pattern Recognition. Clarendon Press, 1995.
13. Kellogg S. Booth and George S. Lueker. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms. J. Comput. Syst. Sci., 13(3):335-379, 1976.
14. Søren Brunak, Jacob Engelbrecht, and Steen Knudsen. Prediction of human mRNA donor and acceptor sites from the DNA sequence. Journal of Computational Biology, 220:49-65, 1991.
15. Alberto Caprara. Sorting by reversals is difficult. In RECOMB, pages 75-83, 1997.
16. Humberto Carillo and David Lipman. The multiple sequence alignment problem in biology. SIAM J. Appl. Math., 48(5):1073-1082, 1988.
17. Oliver Chapelle, Bernhard. Schölkopf, and Alexander Zien. Semi-Supervised Learning. MIT Press, Cambridge, MA, 2006.
18. Olivier Chapelle, Vikas Sindhwani, and S. Sathiya Keerthi. Branch and bound for semi-supervised support vector machines. In NIPS, pages 217-224, 2006.
19. Ling Chen, Lingjun Zou, and Juan Chen. An efficient algorithm for multiple sequences alignment based on ant colony algorithms. In Hamid R. Arabnia, Jack Y. Yang, and Mary Qu Yang, editors, GEM, pages 191-196. CSREA Press, 2007.
20. Peter Clote and Rolf Backofen. Computational Molecular Biology: An Introduction (Wiley Series in Mathematical & Computational Biology). John Wiley & Sons, 2000.
21. International Human Genome Sequencing Consortium. Initial sequencing and analysis of the human genome. Nature, 42:860-921, 2001.
22. Stephen A. Cook. The Complexity of Theorem-Proving Procedures. In STOC, pages 151-158, 1971.
23. Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, and Mihalis Yannakakis. On the Complexity of Protein Folding. Journal of Computational Biology, 5(3):423-466, 1998.
24. Nello Cristianini and John Shawe-Taylor. An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, 2000.
25. Marco Dorigo, Gianni Di Caro, and Luca Maria Gambardella. Ant Algorithms for Discrete Optimization. Artificial Life, 5(2):137-172, 1999.
26. Marco Dorigo and Thomas Stützle. Ant Colony Optimization. MIT Press, Cambridge, MA, 2004.
27. Richard Durbin, Sean R. Eddy, Anders Krogh, and Graeme J. Mitchison. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, 1998.
28. John Gallant, David Maier, and James A. Storer. On Finding Minimal Length Superstrings. J. Comput. Syst. Sci., 20(1):50-58, 1980.
29. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness (Series of Books in the Mathematical Sciences). W. H. Freeman & Co Ltd, 1979.
30. C. Gondro and B. P. Kinghorn. A simple genetic algorithm for multiple sequence alignment. Genet. Mol. Res., 6(4):964-982, 2007.
31. Dan Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997.
32. Sridhar Hannenhalli and Pavel A. Pevzner. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. In STOC, pages 178-189, 1995.
33. Sridhar Hannenhalli and Pavel A. Pevzner. Transforming men into mice (polynomial algorithm for genomic distance problem). In FOCS, pages 581-592, 1995.
34. Dov Harel and Robert Endre Tarjan. Fast Algorithms for Finding Nearest Common Ancestors. SIAM J. Comput., 13(2):338-355, 1984.
35. William E. Hart and Sorin Istrail. Fast Protein Folding in the Hydrophobic-Hydrophillic Model within Three-Eights of Optimal. Journal of Computational Biology, 3(1):53-96, 1996.
36. John H. Holland. Adaptation in natural and artificial systems. MIT Press, Cambridge, MA, USA, 1992.
37. Thomas J. Hudson and et al. An STS-based map of the humane genome. Science, 270:1945-1954, 1995.
38. Richard M. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85-103. 1972.
39. John D. Kececioglu and Eugene W. Myers. Combinatiorial Algorithms for DNA Sequence Assembly. Algorithmica, 13 (1/2):7-51, 1995.
40. John D. Kececioglu and R. Ravi. Of mice and men: Algorithms for evolutionary distances between genomes with translocation. In SODA, pages 604-613, 1995.
41. John D. Kececioglu and David Sankoff. Exact and approximation algorithms for the inversion distance between two chromosomes. In CPM, pages 87-105, 1993.
42. John D. Kececioglu and David Sankoff. Efficient bounds for oriented chromosome inversion distance. In CPM, pages 307-325, 1994.
43. John D. Kececioglu and David Sankoff. Exact and Approximation Algorithms for Sorting by Reversals, with Application to Genome Rearrangement. Algorithmica, 13 (1/2):180-210, 1995.
44. Donald E. Knuth, James H. Morris Jr., and Vaughan R. Pratt. Fast Pattern Matching in Strings. SIAM J. Comput., 6(2):323-350, 1977.
45. Oliver Korb, Thomas Stützle, and Thomas E. Exner. An ant colony optimization approach to flexible protein-ligand docking. Swarm Intelligence, 1(2):115-134, 2007.
46. Timo Koski. Hidden Markov Models for Bioinformatics (Computational Biology). Kluwer Academic Publishers, 2001.
47. Anders Krogh, Michael Brown, I. Saira Mian, K. Sjölander, and David Haussler. Hidden Markov Models in Computational Biology: Applications to Protein Modelling. Journal of Molecular Biology, 235:1501-1531, 1994.
48. Anders Krogh, I. Saira Mian, and David Haussler. Hidden Markov Models that find Genes in E. Coli DNA. Nucleic Acids Research, 22:4768-4778, 1994.
49. Anders Krogh and Søren Kamaric Riis. Prediction of beta sheets in proteins. In NIPS, pages 917-923, 1995.
50. Richard E. Lathrop. The protein threading problem with sequence amino interaction preferences is NP-complete. Protein Engineering, 7(9):1059-1068, 1994.
51. M. Li, B. Ma, and L. Wang. On the Closest String and Substring Problems. J. ACM, 49(2):157-171, 2002.
52. R. B. Lyngso and C. N. Pedersen. RNA pseudoknot prediction in energy based models. J. Comput. Biol., 7 (3-4):409-427, 2001.
53. Martin Middendorf. More on the Complexity of Common Superstring and Supersequence Problems. Theor. Comput. Sci., 125(2):205-228, 1994.
54. Melanie Mitchell. An Introduction to Genetic Algorithms (Complex Adaptive Systems). MIT Press, 1998.
55. Edward M. McCreight. A space-economical suffix tree construction algorithm. J. ACM, 23(2):262-272, 1976.
56. S. B. Needleman and C. D. Wunsch. A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology, 48:443-453, 1970.
57. Henrik Nielsen, Jacob Engelbrecht, Søren Brunak, and Gunnar von Heijne. A Neural Network Method for Identification of Prokaryotic and Eukaryotic Signal Peptides and Prediction of their Cleavage Sites. Int. J. Neural Syst., 8 (5-6):581-599, 1997.
58. Henrik Nielsen and Anders Krogh. Prediction of signal peptides and signal anchors by a hidden markov model. In ISMB, pages 122-130, 1998.
59. C. Notredame and D. G. Higgins. SAGA: sequence alignment by genetic algorithm. Nucleic Acids Res., 24(8):1515-1524, 1996.
60. Ruth Nussinov and Ann B. Jacobson. Fast algorithm for predicting the secondary structure of single stranded RNA. Proceedings of the National Academy of Sciences USA, 71(11):6309-6313, 1980.
61. Christos H. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
62. Anders Gorm Pedersen, Pierre Baldi, Søren Brunak, and Yves Chauvin. Characterization of prokaryotic and eukaryotic promoters using hidden markov models. In ISMB, pages 182-191, 1996.
63. René Peeters. The maximum edge biclique problem is NP-complete. Discrete Applied Mathematics, 131(3):651-654, 2003.
64. Pavel A. Pevzner. Computational Molecular Biology: An Algorithmic Approach. The MIT Press, 2000.
65. N. Qjan and T. J. Sejnowski Predicting the secondary structure of globular proteins using neural network models. Journal of Molecular Biology, 202:865-884, 1988.
66. T. H. Reijmers, Ron Wehrens, and Lutgarde M. C. Buydens. Quality criteria of genetic algorithms for construction of phylogenetic trees. Journal of Computational Chemistry, 20(8):867-876, 1999.
67. B. Schieber and U. Vishkin. On Finding Lowest Common Ancestors: Simplifications and Parallelization. SIAM Journal of Computing, 17:12-884, 1988.
68. Carlos Setubal and Joao Meidanis. Introduction to Computational Molecular Biology. PWS Publishing, 1997.
69. Jeong Seop Sim and Kunsoo Park. The consensus string problem for a metric is NP-complete. J. Discrete Algorithms, 1(1):111-117, 2003.
70. T. F. Smith and M. W. Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195-197, 1981.
71. Esko Ukkonen. On-Line Construction of Suffix Trees. Algorithmica, 14(3):249-260, 1995.
72. Ron Unger and John Moult. Genetic algorithm for 3d protein folding simulations. In ICGA, pages 581-588, 1993.
73. Vladimir Vapnik. The Nature of Statistical Learning Theory (Information Science and Statistics). Springer-Verlag New York Inc., 2001.
74. Vijay V. Vazirani. Approximation Algorithms. Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 2001.
75. J. Craig Venter. Sequencing the human genome. In RECOMB, pages 309-309, 2002.
76. M. Vidyasagar. A Theory of Learning and Generalization (Communications and Control Engineering). Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1996.
77. Lusheng Wang and Tao Jiang, On the Complexity of Multiple Sequence Alignment. Journal of Computational Biology, 1(4):337-348, 1994.
78. M. S. Waterman. Introduction to Computational Biology: Maps, Sequences and Genomes (Interdisciplinary Statistics). Chapman & Hall/CRC, 1995.
79. Peter Weiner. Linear pattern matching algorithms. In FOCS, pages 1-11, 1973.
80. Yong L. Xiao and Donald E. Williams. Molecular docking using genetic algorithms. In SAC'94: Proceedings of the 1994 ACM symposium on Applied computing, pages 196-200, New York, NY, USA, 1994. ACM.
81. M. Zuker and P. Stiegler. Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Res., 9(1):133-148, 1981.