Discrete pattern matching over sequences and interval sets.
Finding matches, both exact and approximate, between a sequence of symbols A and a pattern P has long been an active area of research in algorithm design. Some of the more well-known byproducts from that research are the diffprogram and grep family of programs. These problems form a sub-domain of a...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
The University of Arizona.
1993
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10150/186432 |