Algorithms on strings, trees, and sequences : computer science and computational biology / Dan Gusfield.
Tipo de material:![Texto](/opac-tmpl/lib/famfamfam/BK.png)
- 9780521585194 (hc)
- 0521585198 (hc)
- QA76.9.A43 G8 1997
Tipo de ítem | Biblioteca actual | Colección | Signatura topográfica | Estado | Notas | Fecha de vencimiento | Código de barras | |
---|---|---|---|---|---|---|---|---|
![]() |
Biblioteca Magna a | Acervo General | QA76.9.A43 G8 1997 | Disponible | Préstamo interno (etiqueta naranja) | 154466 |
Bibliografía : p. 505-523
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.