title: A system for pattern matching applications on biosequences.
abstract: ANREP is a system for finding matches to patterns composed of (i) spacing constraints called 'spacers', and (ii) approximate matches to 'motifs' that are, recursively, patterns composed of 'atomic' symbols. A user specifies such patterns via a declarative, free-format and strongly typed language called A that is presented here in a tutorial style through a series of progressively more complex examples. The sample patterns are for protein and DNA sequences, the application domain for which ANREP was specifically created. ANREP provides a unified framework for almost all previously proposed biosequence patterns and extends them by providing approximate matching, a feature heretofore unavailable except for the limited case of individual sequences. The performance of ANREP is discussed and an appendix gives a concise specification of syntax and semantics. A portable C software package implementing ANREP is available via anonymous remote file transfer.
authors.affiliation: Department of Computer Science, University of Arizona, Tucson 85721.
authors.forename: G
authors.initials: G
authors.lastname: Mehldau
authors.forename: G
authors.initials: G
authors.lastname: Myers
mesh_terms: D001483:Base Sequence; D006801:Humans; D008969:Molecular Sequence Data; D010363:Pattern Recognition, Automated; D012984:Software; D014584:User-Computer Interface