Our systems are now restored following recent technical disruption, and we’re working hard to catch up on publishing. We apologise for the inconvenience caused. Find out more

Recommended product

Popular links

Popular links


Algorithms on Strings

Algorithms on Strings

Algorithms on Strings

November 2014
Paperback
9781107670990

    This text and reference on string processes and pattern matching presents examples related to the automatic processing of natural language, to the analysis of molecular sequences and to the management of textual databases. Algorithms are described in a C-like language, with correctness proofs and complexity analysis, to make them ready to implement. The book will be an important resource for students and researchers in theoretical computer science, computational linguistics, computational biology, and software engineering.

    • Few books on the topic, some of which are research monographs or conference proceedings, not suitable for teaching
    • Well adapted to Master's courses on algorithms or text processing
    • Many concepts and examples explained in 135 figures

    Reviews & endorsements

    "The material is well explained and the treatment of the subjects covered is quite complete."
    Ricardo Baeza-Yates, Mathematical Reviews

    See more reviews

    Product details

    November 2014
    Paperback
    9781107670990
    392 pages
    229 × 152 × 21 mm
    0.52kg
    Available

    Table of Contents

    • 1. Tools
    • 2. Pattern matching automata
    • 3. String searching with a sliding window
    • 4. Suffix arrays
    • 5. Structures for indexes
    • 6. Indexes
    • 7. Alignments
    • 8. Approximate patterns
    • 9. Local periods.