Algorithms on Strings, Trees and Sequences

Algorithms on Strings, Trees and Sequences
-35 %
Computer Science and Computational Biology
| Lieferzeit: 1-4 Tage I

Unser bisheriger Preis:ORGPRICE: 100,95 €

Jetzt 65,37 €*

ISBN-13:
9780521585194
Erscheinungsdatum:
01.05.1997
Seiten:
554
Autor:
Dan Gusfield
Gewicht:
1180 g
Format:
261x182x33 mm
Sprache:
Englisch

Inhaltsverzeichnis
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.
Beschreibung
Describes a range of string problems in computer science and molecular biology and the algorithms developed to solve them.

Kunden Rezensionen

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