FLEXIBLE PATTERNS MATCHING IN STRING PRACTICAL ON-LINE SEARCH ALGORITHMS FOR TEXTS AND BIOLOGICAL SEQUENCES

String matching problems range from the relatively simple task of searching a single text for a string of characters to searching a database for approximate occurrences of a complex pattern. Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especially in information retrieval and computational biology. This book presents a practical approach to string matching problems, focusing on the algorithms and implementations that perform best in practice. It covers searching for simple, multiple and extended strings, as well as regular expressions, and exact and approximate searching. It includes all the most significant new developments in complex pattern searching. The clear explanations, step-by-step examples, algorithm pseudocode, and implementation efficiency maps will enable researchers, professionals and students in bioinformatics, computer science, and software engineering to choose the most appropriate algorithms for their applications.

1. Introduction; 2. String matching; 3. Multiple string matching; 4. Extended string matching; 5. Regular expression matching; 6. Approximate matching; 7. Conclusion; Bibliography; Index.

This book presents several new string matching algorithms developed to handle the complex string problems arising from information retrieval and computational biology. The clear explanations, examples, and implementation efficiency maps will enable researchers, professionals and students in bioinformatics, computer science, and software engineering to choose the most appropriate algorithms for their applications.