商品の詳細
Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences

Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences
By Gonzalo Navarro, Mathieu Raffinot

価格: ￥ 5,093 1500円以上は送料無料 詳細

発送可能時期: 在庫あり。
販売、発送は Amazon.co.jp

13 新品/中古商品価格 ￥ 4,316

おすすめ度:

商品の説明

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.

商品の詳細

  • Amazon.co.jp ランキング: #20319 / 本
  • 発売日: 2007-07-26
  • オリジナル言語: 英語
  • 版型: ペーパーバック
  • 232 ページ

エディターレビュー

内容説明
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.

カスタマーレビュー

文字列マッチングの良書5
文字列マッチングは計算機科学の古典でありながら，今なお活発に研究が行われているホットな分野である．本書は現在精力的に研究を行っている著者らによって2002年に出版されたもので，この分野を俯瞰する上でほぼ最新の情報までもが網羅されている点で価値ある1冊といえる．KMPやBMに始まりbit parallelismを導入した効率の良い近似マッチングまでをもカバーしている．
特に擬似コード表記とその挙動を丁寧に示した実行例は各アルゴリズムを理解する上で大変役に立つ．また各アルゴリズムの効率的な適用範囲を示すExperimental mapが章末に付いており実装時にはアルゴリズム選択の参考になるだろう．