Approaches to the automatic discovery of patterns in biosequences

Journal of Computational Biology

Volumn 5, Issue 2, 1998, Pages 279-305

  Brazma, Alvis ^a   Jonassen, Inge ^b   Eidhammer, Ingvar ^b   Gilbert, David ^c  

^a WELLCOME TRUST SANGER INSTITUTE   (United Kingdom)

^b UNIVERSITY OF BERGEN   (Norway)

^c CITY UNIVERSITY   (United Kingdom)

Author keywords

Automatic discovery; Bioinformatics; Biosequences; Machine learning; Patterns

Indexed keywords

ALGORITHM; AMINO ACID SEQUENCE; ARTICLE; CALCULATION; GENE SEQUENCE; INFORMATION SCIENCE; LANGUAGE; PRIORITY JOURNAL; PROBLEM SOLVING;

EID: 0031878759     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.1998.5.279     Document Type: Article

References (77)

1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. 1983. Data Structures and Algorithms. Addison-Wesley.
2. Altschul, S.F., Gish, W., Miller, W., Myers, E.W., and Lipman, D. J. 1990. Basic local alignment search tool. J. Mol. Biol. 215:403-410.
3. Arikawa, S., Kuhara, S., Miyano, S., Shinohara, A., and Shinohara, T. 1992. A learning algorithm for elementary formal systems and its experiments on identification of transmembrane domains. In Proc. 25th Hawaii Int. Conf. on System Sci., 675-684.
4. Arikawa, S., Miyano, S., Shinohara, A., Kuhara, S., Mukouchi, Y., and Shinohara, T. 1993. A machine discovery from amino acid sequences by decision trees over regular patterns. New Generation Computing 11:361-375.
5. Arimura, H., Fujino, R., Shinohara, T., and Arikawa, S. 1994. Protein motif discovery from positive examples by minimal multiple generalization over regular patterns. In Proc. of the 5th Genome Informatics Workshop, 39-48.
6. Bailey, T.L., and Elkan, C. 1995. The value of prior knowledge in discovering motifs with MEME. In Proceedings of the Third International Conference on Intelligent Systems for Molecular Biology, 21-29, AAAI Press.
7. Bailey, T.L. 1995. Discovering motifs in DNA and protein sequences: the approximate common substring problem. Ph.D. Dissertation, University of California, San Diego, USA.
8. Bairoch, A. 1992. PROSITE: a dictionary of sites and patterns in proteins. Nucl. Acids Res. 20:2013-2018.
9. Baldi, P., Chauvin, Y., Hunkapiller, T., and McClure, M.M. 1994. Hidden Markov models of biological primary sequence information. Proc. Natl. Acad. Sci USA 91:1059-1063.
10. Brazma, A., Ukkonen, E., and Vilo, J. 1996a. Discovering unbounded unions of regular pattern languages from positive examples. In Proceedings of 7th Annual International Symposium on Algorithms and Computation (ISAAC-96), Lecture Notes in Computer Science 1178, 95-104.
11. Brazma, A., Jonassen, I., Ukkonen, E., and Vilo, J. 1996b. Discovering patterns and subfamilies in biosequences. In Proc. of Fourth International Conference on Intelligent Systems for Molecular Biology, 34-43. AAAI Press.
12. Brodsky, L.I., Vassilyev, A.V., Kalaydzidis, Y.L., Osipov, Y.S., Tatuzo, R.L., and Feranchuk, S. I. 1992. Genebee: the program package for biopolymer structure analysis. In Gindikin, S., ed., Mathematical methods of analysis of biopolymer sequences, DIMACS series in discrete mathematics and theoretical computer science, volume 8. American Mathematical Society.
13. Bucher, P., and Bairoch, A. 1994. A generalized profile syntax for biomolecular sequence motifs and its function in automatic sequence interpretation. In Proc. of Second International Conference on Intelligent Systems for Molecular Biology, 53-61.
14. Chan, S.C., Wong, A.K.C., and Chiu, D.K.Y. 1992. A survey of multiple sequence comparison methods. Bull. Math. Biol. 54(4):563-598.
15. Clift, B., Haussler, D., McConnell, R., Schneider, T.D., and Stormo, G.D. 1986. Sequence landscapes. Nucl. Acids Res. 14(1):141-158.
16. Dayhoff, M.O. 1978. Atlas of Protein Sequence and Structure, vol. 5. National Biomedical Research Foundation.
17. Freuder, E.C. 1978. Synthesizing constraint expressions. Comm. ACM 21(11):958-966.
18. Garey, M.R., and Johnson, D.S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, NY.
19. Gold, E.M. 1967. Language identification in the limit. Information and Control 10:447-474.
20. Gribskov, M., McLachlan, M., and Eisenberg, D. 1987. Profile analysis: detection of distantly related proteins. Proc. Natl. Acad. Sci. U.S.A 84:4355-4358.
21. Henikoff, S., and Henikoff, J.G. 1991. Automated assembly of protein blocks for database searching. Nucl. Acids Res. 19(23):6565-6572.
22. Henikoff, S., and Henikoff, J.G. 1992. Amino acid substitution matrices from protein blocks. Proc. Natl. Acad. Sci. USA 89:100915-100919.
23. Hui, L.C.K. 1992. Color set size problem with application to string matching. In A. Apostolico, M. Chrochemore, Z., and U. Manber., eds., Proc. of Combinatorial Pattern Matching, 230-243. Springer-Verlag.
24. Hutchinson, A. 1994. Algorithmic Learning. Clarendon Press.
25. Jonassen, I., Collins, J.F., and Higgins, D.G. 1995. Finding flexible patterns in unaligned protein sequences. Protein Sci. 4(8):1587-1595.
26. Jonassen, I., Helgesen, C., and Higgins, D.G. 1996. Scoring function for pattern discovery programs taking into account sequence diversity. Reports in Informatics 116, Dept. of Informatics, University of Bergen.
27. Jonassen, I. 1997. Efficient discovery of conserved patterns using a pattern graph. Comput. Applic. Biosci. 13:509-522.
28. Karlind, S., and Ghandour, G. 1985. The use of multiple alphabets in kappa-gene immunoglobulin DNA sequence comparison. The EMBO Journal 4:1217-1223.
29. Karp, R.M., Miller, R.E., and Rosenberg, A.L. 1972. Rapid identification of repeated patterns in strings, trees and arrays. In 4th ACM Symposium on Theory of Computing, 125-136.
30. Kristensen, T., Lopez, R.S., and Prydz, H. 1992. An estimate of the sequencing error frequency in the DNA sequence databases. DNA Seq. 2:343-346.
31. Krogh, A., Brown, M., Mian, I. S., Sjoelander, K., and Haussler, D. 1994. Hidden Markov model in computational biology. Applications to protein modelling. J. Mol. Biol. 235:1501-1531.
32. Kudo, M., Kitamura-Abe, S., Shimbo, M., and Iida, Y. 1992. Analysis of context of 5′-splice site sequences in mammalian mRNA precursors by subclass method. Comput. Applic. Biosci. 8(4):367-376.
33. Landraud, A.M., Avril, J.-F., and Chretienne, P. 1989. An algorithm for finding a common structure shared by a family of strings. IEEE Transactions on Pattern Analysis and Machine Intelligence 11(8):890-895.
34. Lathrop, R., Webster, T., Smith, R., Winston, P., and Smith, T. 1993. Integrating AI with sequence analysis. In Hunter, L., ed., Artificial Intelligence and Molecular Biology. AAAI Press/The MIT Press. 211-258.
35. Lawrence, C.E., and Reilly, A. A. 1990. An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins: Struct. Funct. Genet. 7:41-51.
36. Lawrence, C.E., Altschul, S.F., Boguski, M. S., Liu, J.S., Neuwald, A.F., and Wootton, J. C. 1993. Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignment. Science 262:208-214.
37. Levenshtein, V. I. 1966. Binary codes capable of correcting deletion, insertions, and reversals. Cybernetics and Control Theory 10:707-710.
38. Li, M., and Vitanyi, P. 1993. An Introduction to Kolmogorov Complexity and its Applications. New York: Springer-Verlag.
39. Lipman, D.J., and Pearson, W.R. 1985. Rapid and sensitive protein similarity searches. Science 227:1435-1441.
40. Martinez, H.M. 1988. A flexible multiple sequence alignment program. Nucl. Acids Res. 16(5):1683-1691.
41. McCreight, E.M. 1976. A space-economical suffix tree construction algorithm. J. ACM 23:262-272.
42. Needleman, S., and Wunsch, C. 1970. A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48:443-454.
43. Neuwald, A.F., and Green, P. 1994. Detecting patterns in protein sequences. J Mol. Biol. 239:689-712.
44. Nix, R.P. 1983. Editing by Example. Ph.D. Dissertation, Yale University, Xerox Palo Alto Research Center, California.
45. Ogiwara, A., Uchiyama, I., Seto, Y., and Kanehisa, M. 1992. Construction of a dictionary of sequence motifs that characterize groups of related proteins. Protein Engng. 5(6):479-488.
46. Posfai, J., Bhagwat, A.S., Posfai, G., and Roberts, R.J. 1989. Prediction motifs derived from cytosine methyltransferases. Nucl. Acids Res. 17(7):2421-2435.
47. Queen, C., Wegman, M.N., and Korn, L.J. 1982. Improvements to a program for DNA analysis: a procedure to find homologies among many sequences. Nucl. Acids Res. 10:449-456.
48. Quinlan, J.R. 1986. Induction of decision trees. Machine Learning 1:81-106.
49. Rissanen, J. 1978. Modeling by the shortest data description. Automatica-J.IFAC 14:465-471.
50. Roytberg, M.A. 1992. A search for common patterns in many sequences. Comput. Applic. Biosci. 8(1):57-64.
51. Sagot, M.F., and Viari, A. 1996. A double combinatorial approach to discovering patterns in biological sequences. In Hirschberg, D., and Myers, G., eds., Combinatorial Pattern Matching, 186-208. Springer-Verlag.
52. Sagot, M.-F., Viari, A., and Soldano, H. 1995a. A distance-based block searching algorithm. In et al, C. R., ed., Proc. of Third International Conference on Intelligent Systems for Molecular Biology, 322-331. Menlo Park, California: AAAI Press.
53. Sagot, M.-F., Viari, A., and Soldano, H. 1995b. Multiple sequence comparison: a peptide matching approach. In Galil, Z., and Ukkonen, E., eds., Proc. of 6th Annual Symposium on Combinatorial Pattern Matching, 366-385. Springer-Verlag.
54. Sankoff, D., and Kruskal, J.B. 1983. Time Warps: String Edits, and Macromolecules: the Theory and Practice of Sequence Comparison. Addison-Wesley.
55. Saqi, M.A.S., and Sternberg, M.J.E. 1994. Identification of sequence motifs from a set of proteins with related function. Protein Engng. 7(2):165-171.
56. Schuler, G.D., Altschul, S.F., and Lipman, D.J. 1991. A workbench for multiple alignment construction and analysis. Proteins: Struct. Funct. Genet. 9:180-190.
57. Sewell, R.F., and Durbin, R. 1995. Method for calculation of probability of matching a bounded regular expression in a random data string. J. Comp. Biol. 2:25-31.
58. Shinohara, T., and Arikawa, S. 1995. Pattern inference. In Jantke, K.P., and Lange, S., eds., Algorithmic learning for knowledge-based systems, GOSLER final report. Springer-Verlag. 259-291.
59. Shinohara, T., 1983. Polynomial time inference of extended regular pattern languages. Lecture Notes in Computer Science 147:115-127.
60. Smith, R.F., and Smith, T.F. 1990. Automatic generation of primary sequence patterns from sets of related protein sequences. In Proc. Natl. Acad. Sci. USA, 118-122.
61. Smith, T., and Waterman, M. 1981. Identification of common molecular subsequences. J. Mol. Biol. 147:195-197.
62. Smith, H.O., Annau, T.M., and Chandrasegaran, S. 1990. Finding sequence motifs in groups of functionally related proteins. In Proc. Natl. Acad. Sci. USA, vol. 87, 826-830.
63. Staden, R. 1989a. Methods for calculating the probabilities of finding patterns in sequences. Comput. Applic. Biosci. 5:89-96.
64. Staden, R. 1989b. Methods for discovering novel motifs in nucleic acid sequences. Comput. Applic. Biosci. 5(4):293-298.
65. Suyama, M., Nishioka, T., and Oda, J. 1995. Searching for common sequence patterns among distantly related proteins. Protein Engng. 8(11):1075-1080.
66. Shoudai, T., Lappe, M., Miyano, S., Shinohara, A., Okazaki, T., Arikava, S., Uchida, T., Shimozono, S., Shinohara, T., and Kuhara, S. 1995. BONSAI Garden: parallel knowledge discovery system for amino acid sequences. In Proc. of Third International Conference on Intelligent Systems for Molecular Biology, 359-366. Melno Park, California: AAAI Press.
67. Tateishi, E., and Miyano, S. 1995. A greedy strategy for finding motifs from positive and negative examples. Technical Report RIFIS-TR-CS-118, Research Institute of Fundamental Information Science, Kyushu University, Japan.
68. Tateishi, E., Maruyama, O., and Miyano, S. 1995. Extracting best consensus motifs from positive and negative examples. Technical Report RIFIS-TR-CS-115, Research Institute of Fundamental Information Science, Kyushu University, Japan.
69. Taylor, W.R. 1986. The classification of amino-acid conservation. J. Theoret. Biol. 119(2):205-218.
70. Ukkonen, E. 1992. Constructing suffix trees on-line in linear time. Information Processing 1:484-492.
71. Valiant, G.L. 1984. A Theory of the Learnable. Comm. ACM 27(11):1134-1142.
72. Vingron, M., and Argos, P. 1991. Motif recognition and alignment for many sequences by comparison of dot-matrices. J. Mol. Biol. 218:33-43.
73. Wang, L., and Jiang, T. 1994. On the complexity of multiple sequence alignment. J. Comp. Biol. 1(4):337-348.
74. Wang, J.T.L., Marr, T.G., Shasha, D., Shapiro, B.A., and Chirn, G.-W. 1994. Discovering active motifs in sets of related protein sequences and using them for classification. Nucl. Acids Res. 22(14):2769-2775.
75. Waterman, M.S., Arratia, R., and Galas, D.J. 1984. Pattern recognition in several sequences: Consensus and alignment. Bull. Math. Biol. 46(4):515-527.
76. Wolferstetter, F., French, K., Herrmann, G., and Werner, T. 1996. Identification of functional elements in unaligned nucleic acid sequences by a novel tuple search algorithm. Comput. Applic. Biosci. 12(1):71-80.
77. Wu, T.D., and Brutlag, D.L. 1995. Identification of protein motifs using conserved amino acid properties and partitioning techniques. In Proc. of Third International Conference on Intelligent Systems for Molecular Biology, 402-410. Menlo Park, California: AAAI Press.