Dekorationsartikel gehören nicht zum Leistungsumfang.
Flexible Pattern Matching in Strings
Practical On-Line Search Algorithms for Texts and Biological Sequences
Taschenbuch von Mathieu Raffinot
Sprache: Englisch

65,70 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

Kategorien:
Beschreibung
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.
Zusammenfassung
Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, mainly arising from information retrieval and computational biology. In this book, the authors present several new string matching algorithms, developed to handle these complex new problems. Unlike most other books, the emphasis is on those techniques that work best in practice, which are also the simplest ones in general. 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.
Inhaltsverzeichnis
1. Introduction; 2. String matching; 3. Multiple string matching; 4. Extended string matching; 5. Regular expression matching; 6. Approximate matching; 7. Conclusion; Bibliography; Index.
Details
Erscheinungsjahr: 2007
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Seiten: 232
ISBN-13: 9780521039932
ISBN-10: 0521039932
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Raffinot, Mathieu
Hersteller: Cambridge University Press
Maße: 244 x 170 x 13 mm
Von/Mit: Mathieu Raffinot
Erscheinungsdatum: 15.05.2007
Gewicht: 0,409 kg
preigu-id: 101998970
Zusammenfassung
Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, mainly arising from information retrieval and computational biology. In this book, the authors present several new string matching algorithms, developed to handle these complex new problems. Unlike most other books, the emphasis is on those techniques that work best in practice, which are also the simplest ones in general. 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.
Inhaltsverzeichnis
1. Introduction; 2. String matching; 3. Multiple string matching; 4. Extended string matching; 5. Regular expression matching; 6. Approximate matching; 7. Conclusion; Bibliography; Index.
Details
Erscheinungsjahr: 2007
Genre: Informatik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Seiten: 232
ISBN-13: 9780521039932
ISBN-10: 0521039932
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Raffinot, Mathieu
Hersteller: Cambridge University Press
Maße: 244 x 170 x 13 mm
Von/Mit: Mathieu Raffinot
Erscheinungsdatum: 15.05.2007
Gewicht: 0,409 kg
preigu-id: 101998970
Warnhinweis

Ähnliche Produkte

Ähnliche Produkte