Book Description
This book provides an introduction to algorithms and data structures that operate efficiently on strings (especially those used to represent long DNA sequences). It focuses on algorithms for sequence analysis (string algorithms), but also covers genome rearrangement problems and phylogenetic reconstruction methods.

Topics and features:
- first unified presentation of enhanced suffix arrays
- up-to-date overview of their applications in computer science and bioinformatics
- special emphasis on solving large-scale problems
- presentation of space-efficient algorithms on strings, based on the Burrows-Wheeler transform and backward search
- comprehensive coverage of sorting by reversals
- in-depth study of distance-based phylogenetic reconstruction algorithms

Primarily aimed at graduate or advanced undergraduate students from computer science or bioinformatics, this book will also interest practitioners and researchers from these fields.