Cargando…
Algorithms on strings, trees, and sequences : computer science and computational biology /
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 1997 book is a gener...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge [England] ; New York :
Cambridge University Press,
1997.
|
| Temas: | |
| Acceso en línea: | Texto completo |
Tabla de Contenidos:
- 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.