Brossura

ISBN 10: 0521039932 ISBN 13: 9780521039932

Casa editrice: Cambridge University Press, 2007

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.

Book Description:

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 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.

Review:

"This book is on the domain of searching.... [It] is actually unique on the subject." Mathematical Reviews