Autor: Dan Gusfield
ISBN-13: 9780521585194
Veröffentl: 01.05.1997
Einband: Buch
Seiten: 554
Gewicht: 1224 g
Format: 261x186x38 mm
Sprache: Englisch

Algorithms on Strings, Trees and Sequences

Computer Science and Computational Biology

Sie erhalten für diesen Artikel

Bücher Thöne Punkte: 149

 Buch
Sofort lieferbar | * inkl. MwSt ggf. zzgl. Versandkosten
96,95 € 74,99 € *
This book describes a range of string problems in computer science and molecular biology and the algorithms developed to solve them.
From the 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 Cam eos:
16. Maps, mapping, sequencing and superstrings
17. Strings and evolutionary trees
18. Three short topics
19. Models of genome-level mutations
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 techn iques also makes it a reference for professionals.

Zu diesem Artikel ist noch keine Rezension vorhanden.
Helfen sie anderen Besuchern und verfassen Sie selbst eine Rezension.

Schreiben Sie Ihre Meinung
und verdienen Sie sich 10 Bonuspunkte

> neue Rezension schreiben
 

Rezensionen

Autor: Dan Gusfield
ISBN-13:: 9780521585194
ISBN: 0521585198
Erscheinungsjahr: 01.05.1997
Verlag: Cambridge University Pr.
Gewicht: 1224g
Seiten: 554
Sprache: Englisch
Sonstiges: Buch, 261x186x38 mm, 145 diagrams