Algorithms on strings, trees, and sequences: computer science and computational biology
Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Gusfield, Dan (VerfasserIn)
Format: Elektronisch E-Book
Sprache:English
Veröffentlicht: Cambridge [England] Cambridge University Press 1997
Schlagworte:
Online-Zugang:FAW01
FAW02
Volltext
Beschreibung:Includes bibliographical references (p. 505-523) and index
Exact matching: fundamental preprocessing and first algorithms -- Exact matching: classical comparison-based methods -- Exact matching: a deeper look at classical methods -- Seminumerical string matching -- Introduction to suffix trees -- Linear-time construction of suffix trees -- First applications of suffix trees -- Constant-time lowest common ancestor retrieval -- More applications of suffix trees -- The importance of (sub)sequence comparison in molecular biology --Core string edits, alignments, and dynamic programming -- Refining core string edits and alignments -- Extending the core problems -- Multiple string comparison -- The Holy Grail -- sequence databases and their uses- The Mother Lode -- Maps, mapping, sequencing, and superstrings -- Strings and evolutionary trees -- Three short topics -- Models of Genome-level mutations
Beschreibung:1 Online-Ressource (xviii, 534 p.)
ISBN:0511574932
0521585198
1139811738
9780511574931
9780521585194
9781139811736

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Volltext öffnen