Flexible Pattern Matching in Strings
Practical On-Line Search Algorithms for Texts and Biological Sequences
Seiten
2007
Cambridge University Press (Verlag)
9780521039932 (ISBN)
Cambridge University Press (Verlag)
9780521039932 (ISBN)
Presents recently developed algorithms for searching for simple, multiple and extended strings, regular expressions, exact and approximate matches.
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.
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.
| Erscheint lt. Verlag | 26.7.2007 |
|---|---|
| Zusatzinfo | 90 Line drawings, unspecified |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 169 x 245 mm |
| Gewicht | 369 g |
| Themenwelt | Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik |
| Naturwissenschaften ► Biologie ► Genetik / Molekularbiologie | |
| ISBN-13 | 9780521039932 / 9780521039932 |
| Zustand | Neuware |
| Informationen gemäß Produktsicherheitsverordnung (GPSR) | |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Eine praxisorientierte Einführung
Buch | Softcover (2025)
Springer Vieweg (Verlag)
CHF 53,15
Künstliche Intelligenz, Macht und das größte Dilemma des 21. …
Buch | Softcover (2025)
C.H.Beck (Verlag)
CHF 25,20
Buch | Softcover (2025)
Reclam, Philipp (Verlag)
CHF 11,20