Skip to content
Register Sign in Wishlist

Algorithms on Strings

£33.99

  • Date Published: November 2014
  • availability: Available
  • format: Paperback
  • isbn: 9781107670990

£ 33.99
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback, eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases.

    • 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
    Read more

    Reviews & endorsements

    '… perfect for lectures on 'stringology', for graduate students as a reference on the topic and for appliers in linguistic or molecular biology …' Acta Scientiarum Mathematicarum

    'This is a good book on string matching and other related algorithms, especially from the theoretical point of view. … The material is well explained and the treatment of the subjects covered is quite complete. … Overall, this book will be of interest to people doing research in combinatorial biology and computational linguistics.' Mathematical 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: November 2014
    • format: Paperback
    • isbn: 9781107670990
    • length: 392 pages
    • dimensions: 229 x 152 x 21 mm
    • weight: 0.52kg
    • availability: 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.

  • Authors

    Maxime Crochemore
    Professor Maxime Crochemore received his PhD in 1978 and his Doctorat d'état in 1983 at the University of Rouen. He got his first professorship position at the University of Paris-Nord in 1975 where he acted as President of the Department of Mathematics and Computer Science for two years. He became professor at the University Paris 7 in 1989 and was involved in the creation of the University of Marne-la-Vallée where he is presently Professor. He also created the Computer Science research laboratory of this university in 1991, which has now more than fifty permanent researchers. He was the director of the laboratory until 2005. Professor Crochemore is Senior Research Fellow at King's College London since 2002.

    Christophe Hancart
    Christophe Hancart received his PhD in Computer Science from the University of Paris 7, France. He is now an assistant professor in the Department of Computer Science at the University of Rouen.

    Thierry Lecroq, Université de Rouen
    Thierry Lecroq received his PhD in Computer Science from the University of Orléans in 1992. He is now a professor in the Department of Computer Science at the University of Rouen.

Sign In

Please sign in to access your account

Cancel

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 lecturers@cambridge.org

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 www.ebooks.com. Please see the permission section of the www.ebooks.com 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.

Cancel

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.
×