Skip to content
Register Sign in Wishlist

Flexible Pattern Matching in Strings
Practical On-Line Search Algorithms for Texts and Biological Sequences


  • Date Published: August 2007
  • availability: Available
  • format: Paperback
  • isbn: 9780521039932

£ 44.99

Add to cart Add to wishlist

Other available formats:

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • String matching problems range from the relatively simple task of searching a single text for a string of characters to searching a database for approximate occurrences of a complex pattern. Recent years have witnessed a dramatic increase of interest in sophisticated string matching problems, especially in information retrieval and computational biology. This book presents a practical approach to string matching problems, focusing on the algorithms and implementations that perform best in practice. It covers searching for simple, multiple and extended strings, as well as regular expressions, and exact and approximate searching. It includes all the most significant new developments in complex pattern searching. The clear explanations, step-by-step examples, algorithm pseudocode, and implementation efficiency maps will enable researchers, professionals and students in bioinformatics, computer science, and software engineering to choose the most appropriate algorithms for their applications.

    • Covers recently developed techniques and the sophisticated search needs of emerging applications such as information retrieval and bioinformatics
    • Practical: includes the fastest and simplest algorithms, implementation details, and efficiency maps
    • Accessible: all algorithms are clearly explained, with step-by-step examples and pseudocode
    Read more

    Reviews & endorsements

    'If you need efficient pattern matching for any kind of string then this is the only book I know that comes even close to providing you [with] the tools for the job.' The Journal of the ACCU

    'I really enjoyed reading and studying this book. I am convinced it is a must-read, especially chapters 4 through 6, for anyone who is involved in the task of designing algorithms for modern string or sequence matching.' Computing Reviews

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: August 2007
    • format: Paperback
    • isbn: 9780521039932
    • length: 232 pages
    • dimensions: 245 x 169 x 10 mm
    • weight: 0.369kg
    • contains: 90 b/w illus.
    • availability: Available
  • Table of Contents

    1. Introduction
    2. String matching
    3. Multiple string matching
    4. Extended string matching
    5. Regular expression matching
    6. Approximate matching
    7. Conclusion

  • Authors

    Gonzalo Navarro, Universidad de Chile

    Mathieu Raffinot, Centre National de la Recherche Scientifique (CNRS), Paris

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.