Cambridge Catalog  
  • Your account
  • View basket
  • Help
Home > Catalog > Algorithms on Strings
Algorithms on Strings
Google Book Search

Search this book



  • Page extent: 392 pages
  • Size: 228 x 152 mm
  • Weight: 0.74 kg

Library of Congress

  • Dewey number: 005.1
  • Dewey version: 22
  • LC Classification: QA76.9.A43 C757 2007
  • LC Subject headings:
    • Computer algorithms
    • Matching theory
    • Computational biology

Library of Congress Record

Add to basket


 (ISBN-13: 9780521848992)

Manufactured on demand: supplied direct from the printer

$160.00 (C)

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.


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.


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

printer iconPrinter friendly version AddThis