The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm.
Abstract
MOTIVATION: The discovery of motifs in biological sequences is an important problem. RESULTS: This paper presents a new algorithm for the discovery of rigid patterns (motifs) in biological sequences. Our method is combinatorial in nature and able to produce all patterns that appear in at least a (user-defined) minimum number of sequences, yet it manages to be very efficient by avoiding the enumeration of the entire pattern space. Furthermore, the reported patterns are maximal: any reported pattern cannot be made more specific and still keep on appearing at the exact same positions within the input sequences. The effectiveness of the proposed approach is showcased on a number of test cases which aim to: (i) validate the approach through the discovery of previously reported patterns; (ii) demonstrate the capability to identify automatically highly selective patterns particular to the sequences under consideration. Finally, experimental analysis indicates that the algorithm is output sensitive, i.e. its running time is quasi-linear to the size of the generated output.
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
(1979) · Cited by 43,841
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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
The SWISS-PROT protein sequence data bank and its supplement TrEMBL
Bairoch, A., & Apweiler, R. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.1.31 · Cited by 3,587
Watson, J. D. (1970) · Cold Spring Harbor Laboratory Institutional Repository (Cold Spring Harbor Laboratory) · Cited by 2,062
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
The Complexity of Some Problems on Subsequences and Supersequences
Maier, D. (1978) · Journal of the ACM · doi:10.1145/322063.322075 · Cited by 616
The Multiple Sequence Alignment Problem in Biology
Carrillo-Calvet, H., & Lipman, D. J. (1988) · SIAM Journal on Applied Mathematics · doi:10.1137/0148063 · Cited by 526
The protein identification resource (PIR)
Sidman, K. E., George, D. G., Barker, W. C., & Hunt, L. T. (1988) · Nucleic Acids Research · doi:10.1093/nar/16.5.1869 · Cited by 386
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
Self-citationDNA 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
COBALT: constraint-based alignment tool for multiple protein sequences
Papadopoulos, J. S., & Agarwala, R. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm076 · Cited by 1,127
Schwartz, D., & Gygi, S. P. (2005) · Nature Biotechnology · doi:10.1038/nbt1146 · Cited by 879
Non-classical protein secretion in bacteria
Bendtsen, J. D., Kiemer, L., Fausbøll, A., & Brunak, S. (2005) · BMC Microbiology · doi:10.1186/1471-2180-5-58 · Cited by 706
MAFIA: a maximal frequent itemset algorithm for transactional databases
Burdick, D., Calimlim, M., & Gehrke, J. (2002) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914857 · Cited by 612
Antimicrobial peptides: an overview of a promising class of therapeutics
Giuliani, A., Pirri, G., & Nicoletto, S. (2007) · Open Life Sciences · doi:10.2478/s11535-007-0010-5 · Cited by 606
Probabilistic discovery of time series motifs
Chiu, B., Keogh, E., & Lonardi, S. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956808 · Cited by 573
Clustering intrusion detection alarms to support root cause analysis
Julisch, K. (2003) · ACM Transactions on Information and System Security · doi:10.1145/950191.950192 · Cited by 419
Anomaly detection using call stack information
Feng, H. H., Kolesnikov, O. M., Fogla, P., Lee, W., & Gong, W. (2004) · Proceedings 19th International Conference on Data Engineering (Cat. No.03CH37405) · doi:10.1109/secpri.2003.1199328 · Cited by 386
Series in Machine Perception and Artificial Intelligence
(2012) · Series in machine perception and artificial intelligence · doi:10.1142/smpai · Cited by 365
Systematic Discovery of New Recognition Peptides Mediating Protein Interaction Networks
Neduva, V., Linding, R., Su-Angrand, I., Stark, A., Masi, F. D., Gibson, T. J., Lewis, J., Serrano, L., & Russell, R. B. (2005) · PLoS Biology · doi:10.1371/journal.pbio.0030405 · Cited by 359
Unsupervised Pattern Discovery in Speech
Park, A. S., & Glass, J. R. (2008) · IEEE Transactions on Audio, Speech, and Language Processing · doi:10.1109/tasl.2007.909282 · Cited by 351
Depth first generation of long patterns
Agarwal, R. C., Aggarwal, C. C., & Prasad, V. V. V. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347114 · Cited by 325
Azumi, K., De Santis, R., De Tomaso, A., Rigoutsos, I., Yoshizaki, F., Pinto, M. R., Marino, R., Shida, K., Ikeda, M., Ikeda, M., et al. (2003) · Immunogenetics · doi:10.1007/s00251-003-0606-5 · Cited by 302
Self-citationCorcoran, D. L., Pandit, K. V., Gordon, B., Bhattacharjee, A., Kaminski, N., & Benos, P. V. (2009) · PLoS ONE · doi:10.1371/journal.pone.0005279 · Cited by 300
Analysis of evolution of exon-intron structure of eukaryotic genes
Rogozin, I. B. (2005) · Briefings in Bioinformatics · doi:10.1093/bib/6.2.118 · Cited by 268
MAFIA: a maximal frequent itemset algorithm
Burdick, D., Calimlim, M., Flannick, J., Gehrke, J., & Yiu, T. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.183 · Cited by 267
Site-Mapping of In Vitro S-nitrosation in Cardiac Mitochondria: Implications for Cardioprotection
Murray, C. I., Kane, L. A., Uhrigshardt, H., Wang, S.-B., & Van Eyk, J. E. (2011) · Molecular & Cellular Proteomics · doi:10.1074/mcp.m110.004721 · Cited by 63
Metadata
- Authors
- Rigoutsos, I., & Floratos, A.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 1998-01-01
- Volume
- 14
- Issue
- 1
- Pages
- 55-67
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2028903194
- Cited by
- 557
- References
- 29
- FWCI
- 13.57
- 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.