Algorithms on Strings, Trees, and Sequences : Computer Science and Computational Biology

個数：
電子版価格
¥11,642
  • 電書あり

Algorithms on Strings, Trees, and Sequences : Computer Science and Computational Biology

  • 提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
    【重要ご説明事項】
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合、分割発送となる場合がございます。
    3. 美品のご指定は承りかねます。
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Hardcover:ハードカバー版／ページ数 556 p.
  • 言語 ENG
  • 商品コード 9780521585194
  • DDC分類 005.1

Full Description

String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This book is a general text on computer algorithms for string processing. In addition to pure computer science, the book contains extensive discussions on biological problems that are cast as string problems, and on methods developed to solve them. It emphasises the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatics. Its discussion of current algorithms and techniques also makes it a reference for professionals.

Contents

Part I. Exact String Matching: The Fundamental String Problem: 1. Exact matching: fundamental preprocessing and first algorithms; 2. Exact matching: classical comparison-based methods; 3. Exact matching: a deeper look at classical methods; 4. Semi-numerical string matching; Part II. Suffix Trees and their Uses: 5. Introduction to suffix trees; 6. Linear time construction of suffix trees; 7. First applications of suffix trees; 8. Constant time lowest common ancestor retrieval; 9. More applications of suffix trees; Part III. Inexact Matching, Sequence Alignment and Dynamic Programming: 10. The importance of (sub)sequence comparison in molecular biology; 11. Core string edits, alignments and dynamic programming; 12. Refining core string edits and alignments; 13. Extending the core problems; 14. Multiple string comparison: the Holy Grail; 15. Sequence database and their uses: the motherlode; Part IV. Currents, Cousins and Cameos: 16. Maps, mapping, sequencing and superstrings; 17. Strings and evolutionary trees; 18. Three short topics; 19. Models of genome-level mutations.