A fast pattern matching algorithm

Journal of Chemical Information and Computer Sciences

Volumn 44, Issue 4, 2004, Pages 1251-1256

  Sheik, S S ^a   Aggarwal, Sumit K ^a   Poddar, Anindya ^a   Balakrishnan, N ^a   Sekar, K ^a  

^a INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AMINO ACIDS; CHARACTER RECOGNITION; DATABASE SYSTEMS; PATTERN MATCHING; PROBABILITY;

PATTERN MATCHING ALGORITHMS; QUICK SEARCH; SHIFT FACTOR;

DIGITAL COMPUTERS;

DNA; PROTEIN;

ALGORITHM; AMINO ACID SEQUENCE; ARTICLE; COMPARATIVE STUDY; GENETICS; GENOME; HUMAN; MOLECULAR GENETICS; NUCLEOTIDE SEQUENCE; SEQUENCE ALIGNMENT; STATISTICS;

ALGORITHMS; AMINO ACID SEQUENCE; BASE SEQUENCE; DNA; GENOME, HUMAN; HUMANS; MOLECULAR SEQUENCE DATA; PROTEINS; SEQUENCE ALIGNMENT;

EID: 4043092709     PISSN: 00952338     EISSN: None     Source Type: Journal    
DOI: 10.1021/ci030463z     Document Type: Article

References (5)

1. Boyer, R. S.; Moore, J. S. A fast string searching algorithm. Commun. ACM 1977, 20, 762-772.
2. Sunday, D. M. A very fast substring search algorithm. Commun. ACM 1990, 33(8), 132-142.
3. Raita, T. Tuning the Boyer-Moore-Horspool string-searching algorithm. Software - Practice Experience 1992, 22(10), 879-884.
4. Horspool, R. N. Practical fast searching in strings. Software - Practice Experience 1980, 10(6), 501-506.
5. Charras, C.; Lecroq, T. Handbook of exact string matching algorithms (Available at the web site - http://www-igm.umv-mlv.fr/~lecroq/string/).