Flexible Pattern Matching in Strings读书介绍
| 类别 | 页数 | 译者 | 网友评分 | 年代 | 出版社 |
|---|---|---|---|---|---|
| 书籍 | 232页 | 2020 | Cambridge University Press |
| 定价 | 出版日期 | 最近访问 | 访问指数 |
|---|---|---|---|
| USD 64.99 | 2020-02-20 … | 2020-06-04 … | 30 |
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 pr...
作者简介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.
剧情呢，免费看分享剧情、挑选影视作品、精选好书简介分享。