このページを日本語で表示しますか?ここをクリック

 

or
Sign in to turn on 1-Click ordering.
 
 
More Buying Choices
14 used & new from ¥ 4,316

Have one to sell? Sell yours here
 
   
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 (著) "String matching can be understood as the problem of finding a pattern with some property within a given sequence of symbols ..." (more)
5.0 out of 5 stars  See all reviews (1 customer review)
Price: ¥ 5,093 (Tax Included) & eligible for Free Shipping. Details
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Usually ships within 2 to 3 weeks. Click here for details of availability.
Ships from and sold by Amazon.co.jp. Gift-wrap available.

10 new from ¥ 4,316 4 used from ¥ 5,310

Special Offers and Product Promotions


Frequently Bought Together

Customers buy this book with Algorithms on Strings by Maxime Crochemore

Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences + Algorithms on Strings
Price For Both: ¥ 13,243

One of these items ships sooner than the other. Show details

  • This item: Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences by Gonzalo Navarro

    Usually ships within 2 to 3 weeks. Click here for details of availability.
    Ships from and sold by Amazon.co.jp.
    This item ships for FREE shipping more than 1500 yen . Details

  • Algorithms on Strings by Maxime Crochemore

    Usually ships within 11 to 14 days. Click here for details of availability.
    Ships from and sold by Amazon.co.jp.
    This item ships for FREE shipping more than 1500 yen . Details


Customers Who Bought This Item Also Bought

Algorithms on Strings

Algorithms on Strings

by Maxime Crochemore
¥ 8,150
データマイニングによる異常検知

データマイニングによる異常検知

by 山西 健司
4.0 out of 5 stars (3)  ¥ 3,990
Managing Gigabytes: Compressing and Indexing Documents and Images, Second Edition (The Morgan Kaufmann Series in Multimedia Information and Systems)

Managing Gigabytes: Compressing and Indexing Documents and Images, Second Edition (The Morgan Kaufmann Series in Multimedia Information and Systems)

by Ian H. Witten
4.0 out of 5 stars (1)  ¥ 8,422
Search Engines: Information Retrieval in Practice

Search Engines: Information Retrieval in Practice

by Bruce Croft
¥ 8,612
Understanding Search Engines: Mathematical Modeling and Text Retrieval (Software, Environments and Tools)

Understanding Search Engines: Mathematical Modeling and Text Retrieval (Software, Environments and Tools)

by Michael W. Berry
¥ 3,277
Explore similar items

Product Description

内容説明

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.


Book Description

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.
--This text refers to the ハードカバー edition.

Product Details

  • ペーパーバック: 232 pages
  • Publisher: Cambridge University Press; 1 edition (2007/7/26)
  • Language: 英語, 英語, 英語
  • ISBN-10: 0521039932
  • ISBN-13: 978-0521039932
  • Release Date: 2007/7/26
  • Product Dimensions: 9.5 x 6.7 x 0.8 inches
  • Average Customer Review: 5.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon.co.jp Sales Rank: #6,219 in 洋書 (See Bestsellers in 洋書)

    Popular in these categories:

    #12 in  洋書 > Computers & Internet > Programming > Algorithms
    #16 in  洋書 > Computers & Internet > Home Computing
    #42 in  洋書 > Science > Biological Sciences > Biology
  • See Complete Table of Contents

Inside This Book (Learn More)
Browse and search another edition of this book.
First Sentence
String matching can be understood as the problem of finding a pattern with some property within a given sequence of symbols. Read the first page
Explore More
Concordance
Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Index | Back Cover
Search inside this book:

Tag this product

 (What's this?)
Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items.
Your tags: Add your first tag
 

 

Customer Reviews

1 Review
5 star:
 (1)
4 star:    (0)
3 star:    (0)
2 star:    (0)
1 star:    (0)
 
 
 
 
 
Average Customer Review
5.0 out of 5 stars (1 customer review)
 
 
 
 
Share your thoughts with other customers:
Most helpful customer reviews

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


Share your thoughts with other customers: Create your own review
 
 
 
Only search this product's reviews



Customer Discussions

※ Posts in Customer Discussions are written by other customers. Amazon.co.jp supports the free exchange of customer opinions, whether positive or negative. Please use your own judgment when making product purchase decisions.
This product's forum
Discussion Replies Latest Post
No discussions yet

Ask questions, Share opinions, Gain insight
Start a new discussion
Topic:
First post:
Prompts for sign-in
 

   


Listmania!


Look for similar items by category


Look for similar items by subject


Feedback



Your Recent History

 (What's this?)

After viewing product detail pages or search results, look here to find an easy way to navigate back to pages you are interested in.