TOC:
Part I. Exact String
Matching: The Fundamental String Problem:
- Exact matching:
fundamental preprocessing and first algorithms
- Exact matching:
classical comparison-based methods
- Exact matching:
a deeper look at classical methods
- Semi-numerical
string matching
Part II. Suffix
Trees And Their Uses:
- 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
Part III. Inexact
Matching, Sequence Alignment, And Dynamic Programming:
- 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 database
and their uses: the motherlode
Part IV. Currents,
Cousins And Cameos:
- Maps, mapping,
sequencing and superstrings;
- Strings and evolutionary
trees
- Three short topics
- Models of genome-level
mutations
Hardback, pages 554,
145 line diagrams; 262 x 185 mm, 1.185kg ;
Cambridge |