Discovering Patterns and Subfamilies in Biosequences

Proceedings of the 4th International Conference on Intelligent Systems for Molecular Biology, ISMB 1996

Volumn , Issue , 1996, Pages 34-43

  Brāzma, Alvis ^a   Jonassen, Inge ^b   Ukkonen, Esko ^c   Vilo, Jaak ^c  

^a UNIVERSITY OF LATVIA   (Latvia)

^b UNIVERSITY OF BERGEN   (Norway)

^c UNIVERSITY OF HELSINKI   (Finland)

Author keywords

algorithms; Bayesian inference; clustering; machine learning; MDL principle; pattern discovery; PROSITE; protein subfamilies; sequence motifs

Indexed keywords

BAYESIAN NETWORKS; CLUSTERING ALGORITHMS; LEARNING SYSTEMS;

AUTOMATIC DISCOVERY; BAYESIAN INFERENCE; BIOSEQUENCES; CLUSTERINGS; MACHINE-LEARNING; MINIMUM DESCRIPTION LENGTH PRINCIPLE; PATTERN DISCOVERY; PROSITE; PROTEIN SUBFAMILY; SEQUENCE MOTIFS;

INFERENCE ENGINES;

ALGORITHM; ANIMAL; CHEMICAL STRUCTURE; COMPUTER PROGRAM; PHYLOGENY; PROTEIN CONFORMATION; REVIEW;

ALGORITHMS; ANIMALS; MODELS, MOLECULAR; PHYLOGENY; PROTEIN CONFORMATION; SOFTWARE;

EID: 0030332665     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Aasland, R., and Stewart, F.A. 1995. The chromo shadow domain, a second chromo domain in heterchronmtin-binding protein 1, HP1. Nucleic Acids Research 23:3168-3173.
2. Altschul, S. F.; Gish, W.; Miller, W.; Myers, E. W.; and Lipman, D. J. 1990. Basic local alignment search tool. Journal of Molecular Biology 215:403-410.
3. Bailey, T., and Elkan, C. 1995. Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning 21:51-80.
4. Bairoch, A. 1992. PROSITE:a dictionary of sites and patterns in proteins. Nucleic Acids Research 20:2013-2018.
5. Brazma, A.; Jonassen, I.; Eidhammer, I.; and Gilbert, D. 1995. Approaches to automatic discovery of patterns in biosequences. Technical Report TR-113, Department of Informatics, University of Bergen, Bergen, Norway. (Available at ftp://ftp.ii.uib.no/pub/bio/papers/survey, ps).
6. Brazma,A.;Ukkonen,E.;andVilo,J. 1995.Find-inga goodcollection ofpatterns covering a setofsequences.Technical Report C-1995-60, Department of Computer Science, University of Helsinki, P. O. Bo 26, FIN-00014, University of Helsinki. (Available at ftp://ftp.cs.helsinki, f i/pub/Reports/).
7. ChvAtal, V. 1979. A greedy heuristic for the set-covering problem. Math. Oper. Res. 4:233-235.
8. Conklin, D. 1995. Machine discovery of protein motifs. Machine Learning 21:125-150.
9. Etzold, T., and Argos, P. 1993. SRS - an indexing and retrieval tool for flat file data libraries. Comput Appl Biosci 9:49-57.
10. 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.
11. Jonassen, I.; Collins, J. F.; and Higgins, D. G. 1995. Finding flexible patterns in unaligned protein sequences. Protein Science 4(8):1587-1595.
12. Jonassen, I.; Helgesen, C.; and Higgins, D. 1996. Scoring function for pattern discovery programs taking into account sequence diversity. Technical Report 116, Departmentof Informatics, University of Bergen, Bergen, Norway.
13. Jonassen, I. 1996. Efficient discovery of conserved patterns using a pattern graph. Reports in Informatics in preparation, Dept. of Informatics, Unviersity of Bergen. (Available at ftp://ftp.±i.uib.no/pub/bio/papers/).
14. Kilpelinen, P.; Mannila, H.; and Ukkonen, E. 1995. MDLlearning of unions of simple pattern languages from positive examples. In Proceedings of the 2nd European conference EuroCOLT’95, 252-260.
15. Krogh, A.; Brown, M.; Mian, I. S.; Sjoelander, K.; and Haussler, D. 1994. Hidden Markov model in computational biology. Applications to protein modelling. Journal of Molecular Biology 235:1501-1531.
16. Li, M., and Vitanyi, P. 1993. An introduction to Kolmogorov complexity and its applications. Texts and monographs in computer science. New York: Springer-Verlag.
17. Neuwald, A. F., and Green, P. 1994. Detecting patterns in protein sequences. Journal of MolecularBiology 239:689-712.
18. Neuwald,A. F.; Liu, J. S.; and Lawrence, C. E. 1995. Gibbs motif sampling: Detection of bacterial outer membraneprotein repeats. Protein Science 4:1618-1632.
19. Rissanen, J. 1978. Modeling by the shortest data description. Automatica-J.IFAC 14:465-471.
20. Sagot, M.-F.; Viari, A.; and Soldano, H. 1995. Multiple sequence comparison: a peptide matching approach. In Galil, Z., and Ukkonen, E., eds., Proc. of 6th Annual Symposium, CPM(Lecture Notes in Computer Science 937), 366-385. Springer.
21. Saitou, N., and Nei, M. 1987. The neighbour-joining method: a new method for reconstructing phylogenetic trees. Mol. Biol. Evol. 4:406-425.
22. Saqi, M.A. S., and Sternberg, M.J. E. 1994. Identification of sequencemotifs froma set of proteins with related function. Protein Engineering 7(2):165-171.
23. 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.
24. 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, 826-830.
25. T. Shoudai, M.; Lape, M.; Miyano, S.; Shinohara, A.; Okazaki, T.; Arikawa, S.; Uchida, T.; Shimozono,S.; Shinohara, T.; and Kuhara, S. 1995. BONSAI garden: parallel knowledge discovery system for amino acid sequences. In C. Rawlings et al., ed., Proc. of Third International Conference on Intelligent Systems for Molecualar Biology, 359-366. MenloPark, California: AAAIPress.
26. Thompson,J.; Higgins, D. G.; and Gibson, T. J. 1994. Clustal W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Research 22:46.
27. Wu,T. D., and Brutlag, D. L. 1995. Identificaion of protein motifs using conserved amino acid properties and partitioning techniques. In C. Rawlingset al., ed., Proc. of Third International Conferenceon Intelligent Systems for Molecular Biology, 402-410. MenloPark, California: AAAIPress.