Approaches to the Automatic Discovery of Patterns in Biosequences
- 1 January 1998
- journal article
- review article
- Published by Mary Ann Liebert Inc in Journal of Computational Biology
- Vol. 5 (2), 279-305
- https://doi.org/10.1089/cmb.1998.5.279
Abstract
This paper is a survey of approaches and algorithms used for the automatic discovery ofpatterns in biosequences. Patterns with the expressive power in the class of regular languagesare considered, and a classification of pattern languages in this class is developed, coveringthose patterns which are the most frequently used in molecular bioinformatics. A formulationis given of the problem of the automatic discovery of such patterns from a set of sequences,and an analysis presented of the...Keywords
This publication has 42 references indexed in Scilit:
- Discovering unbounded unions of regular pattern languages from positive examplesPublished by Springer Science and Business Media LLC ,1996
- Hidden Markov models of biological primary sequence information.Proceedings of the National Academy of Sciences of the United States of America, 1994
- A machine discovery from amino acid sequences by decision trees over regular patternsNew Generation Computing, 1993
- A survey of multiple sequence comparison methodsBulletin of Mathematical Biology, 1992
- Prosite: a dictionary of sites and patterns in proteinsNucleic Acids Research, 1992
- Basic local alignment search toolJournal of Molecular Biology, 1990
- Profile analysis: detection of distantly related proteins.Proceedings of the National Academy of Sciences of the United States of America, 1987
- Sequence landscapesNucleic Acids Research, 1986
- Synthesizing constraint expressionsCommunications of the ACM, 1978
- Language identification in the limitInformation and Control, 1967