Algorithms on strings, trees, and sequences computer science and computational biology /
| Основен автор: | Gusfield, Dan. |
|---|---|
| Формат: | Електронен |
| Език: | English |
| Публикувано: |
Cambridge [England] ; New York :
Cambridge University Press,
1997.
|
| Предмети: | |
| Онлайн достъп: |
http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=502387 |
| Подобни документи: |
Print version::
Algorithms on strings, trees, and sequences. |
Съдържание:
- 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.