The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Approaches to the Automatic Discovery of Patterns in Biosequences
Abstract
This paper surveys approaches to the discovery of patterns in biosequences and places these approaches within a formal framework that systematises the types of patterns and the discovery algorithms. Patterns with expressive power in the class of regular languages are considered, and a classification of pattern languages in this class is developed, covering the patterns that are the most frequently used in molecular bioinformatics. A formulation is given of the problem of the automatic discovery of such patterns from a set of sequences, and an analysis is presented of the ways in which an assessment can be made of the significance of the discovered patterns. It is shown that the problem is related to problems studied in the field of machine learning. The major part of this paper comprises a review of a number of existing methods developed to solve the problem and how these relate to each other, focusing on the algorithms underlying the approaches. A comparison is given of the algorithms, and examples are given of patterns that have been discovered using the different methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Basic local alignment search tool
Altschul, S. F., Gish, W., Miller, W., Myers, E. W., & Lipman, D. J. (1990) · Journal of Molecular Biology · doi:10.1006/jmbi.1990.9999 · Cited by 98,669
Quinlan, J. R. (1986) · Machine Learning · doi:10.1007/bf00116251 · Cited by 21,439
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288
Identification of common molecular subsequences
Smith, T. F., & Waterman, M. S. (1981) · Journal of Molecular Biology · doi:10.1016/0022-2836(81)90087-5 · Cited by 9,940
Amino acid substitution matrices from protein blocks.
Henikoff, S., & Henikoff, J. G. (1992) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.89.22.10915 · Cited by 6,218
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
Rapid and sensitive protein similarity searches
Lipman, D. J., & Pearson, W. R. (1985) · Science · doi:10.1126/science.2983426 · Cited by 4,033
Language identification in the limit
Gold, E. M. (1967) · Information and Control · doi:10.1016/s0019-9958(67)91165-5 · Cited by 3,572
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Hidden Markov Models in Computational Biology
Krogh, A., Brown, M., Mian, I. S., Sjölander, K., & Haussler, D. (1994) · Journal of Molecular Biology · doi:10.1006/jmbi.1994.1104 · Cited by 1,943
Detecting Subtle Sequence Signals: a Gibbs Sampling Strategy for Multiple Alignment
Lawrence, C. E., Altschul, S. F., Boguski, M. S., Liu, J. S., Neuwald, A. F., & Wootton, J. C. (1993) · Science · doi:10.1126/science.8211139 · Cited by 1,807
Profile analysis: detection of distantly related proteins.
Gribskov, M., McLachlan, A. D., & Eisenberg, D. (1987) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.84.13.4355 · Cited by 1,325
A workbench for multiple alignment construction and analysis
Schuler, G. D., Altschul, S. F., & Lipman, D. J. (1991) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.340090304 · Cited by 985
On the Complexity of Multiple Sequence Alignment
WANG, L., & JIANG, T. (1994) · Journal of Computational Biology · doi:10.1089/cmb.1994.1.337 · Cited by 934
Prosite: a dictionary of sites and patterns in proteins
Bairoch, A. (1992) · Nucleic Acids Research · doi:10.1093/nar/20.suppl.2013 · Cited by 927
The classification of amino acid conservation
Taylor, W. R. (1986) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(86)80075-3 · Cited by 566
Synthesizing constraint expressions
Freuder, E. C. (1978) · Communications of the ACM · doi:10.1145/359642.359654 · Cited by 538
Lawrence, C. E., & Reilly, A. A. (1990) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.340070105 · Cited by 526
Predictive motifs derived from cytosine methyltransferases
Pósfai, J., Bhagwat, A. S., Pósfai, G., & Roberts, R. J. (1989) · Nucleic Acids Research · doi:10.1093/nar/17.7.2421 · Cited by 491
Automated assembly of protein blocks for database searching
Henikoff, S., & Henikoff, J. G. (1991) · Nucleic Acids Research · doi:10.1093/nar/19.23.6565 · Cited by 466
Hidden Markov models of biological primary sequence information.
Baldi, P., Chauvin, Y., Hunkapiller, T., & McClure, M. A. (1994) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.91.3.1059 · Cited by 450
Finding flexible patterns in unaligned protein sequences
Jonassen, I., Collins, J. F., & Higgins, D. G. (1995) · Protein Science · doi:10.1002/pro.5560040817 · Cited by 297
Self-citationAutomatic generation of primary sequence patterns from sets of related protein sequences.
Smith, R. F., & Smith, T. F. (1990) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.87.1.118 · Cited by 286
The biology of eukaryotic promoter prediction—a review
Pedersen, A. G., Baldi, P., Chauvin, Y., & Brunak, S. (1999) · Computers & Chemistry · doi:10.1016/s0097-8485(99)00015-7 · Cited by 224
Finding sequence motifs in groups of functionally related proteins.
Smith, H. O., Annau, T. M., & Chandrasegaran, S. (1990) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.87.2.826 · Cited by 203
Pattern recognition in several sequences: Consensus and alignment
Waterman, M. S., Arratia, R., & Galas, D. J. (1984) · Bulletin of Mathematical Biology · doi:10.1007/bf02459500 · Cited by 158
A survey of multiple sequence comparison methods
Chan, S. C., Wong, A. K. C., & Chiu, D. K. Y. (1992) · Bulletin of Mathematical Biology · doi:10.1007/bf02459635 · Cited by 133
Motif recognition and alignment for many sequences by comparison of dot-matrices
Vingron, M., & Argos, P. (1991) · Journal of Molecular Biology · doi:10.1016/0022-2836(91)90871-3 · Cited by 112
Detecting Patterns in Protein Sequences
Neuwald, A. F., & Green, P. (1994) · Journal of Molecular Biology · doi:10.1006/jmbi.1994.1407 · Cited by 105
A flexible multiple sequence alignment program
Martínez, H. M. (1988) · Nucleic Acids Research · doi:10.1093/nar/16.5.1683 · Cited by 74
A machine discovery from amino acid sequences by decision trees over regular patterns
Arikawa, S., Miyano, S., Shinohara, A., Kuhara, S., Mukouchi, Y., & Shinohara, T. (1993) · New Generation Computing · doi:10.1007/bf03037183 · Cited by 73
Discovering active motifs in sets of related protein sequences and using them for classification
Wang, J. T. L., Marr, T. G., Shasha, D. E., Shapiro, B. A., & Chirn, G. (1994) · Nucleic Acids Research · doi:10.1093/nar/22.14.2769 · Cited by 49
Clift, B., Haussler, D. H., McConnell, R. M., Schneider, T. D., & Stormo, G. D. (1986) · Nucleic Acids Research · doi:10.1093/nar/14.1.141 · Cited by 43
Construction of a dictionary of sequence motifs that characterize groups of related proteins
Ogiwara, A., Uchiyama, I., Seto, Y., et al. (1992) · Protein Engineering Design and Selection · doi:10.1093/protein/5.6.479 · Cited by 42
An estimate of the sequencing error frequency in the DNA sequence databases
Kristensen, T., López, R., & Prydz, H. (1992) · DNA sequence · doi:10.3109/10425179209020815 · Cited by 30
An algorithm for finding a common structure shared by a family of strings
Landraud, A. M., Avril, J.-F., & Chrétienne, P. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.31450 · Cited by 22
Cited by
Miranda, K. C., Huynh, T., Tay, Y., Ang, Y.-S., Tam, W.-L., Thomson, A. M., Lim, B., & Rigoutsos, I. (2006) · Cell · doi:10.1016/j.cell.2006.07.031 · Cited by 2,063
Prediction of continuous B‐cell epitopes in an antigen using recurrent neural network
Saha, S., & Raghava, G. P. S. (2006) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.21078 · Cited by 1,747
DNA binding sites: representation and discovery
Stormo, G. D. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.1.16 · Cited by 1,502
Handbook of Constraint Programming
(2006) · Foundations of Artificial Intelligence · doi:10.1016/s1574-6526(06)x8001-x · Cited by 1,483
Discovering models of software processes from event-based data
Cook, J. E., & Wolf, A. L. (1998) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/287000.287001 · Cited by 870
Metadata
- Authors
- BRAZMA, A., JONASSEN, I., EIDHAMMER, I., & GILBERT, D.
- Venue
- Journal of Computational Biology
- Publisher
- SAGE Publications
- Published
- 1998-01
- Volume
- 5
- Issue
- 2
- Pages
- 279-305
- ISSN
- 1066-5277 (ISSN-L)
- 1557-8666
- OpenAlex
- W2009566340
- Cited by
- 303
- References
- 36
- FWCI
- 5.40
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.