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

Item added to bagSorry, there was a problem getting your bag informationItem cannot be purchased with the existing contents of your bagItem unavailable online
✕

was added to your bag.

Please try again.

Sorry, this item cannot be purchased in the same transaction as the existing items in your bag.

Please complete the purchase of the items currently in your bag and then add this item in a separate transaction or visit Shopping Help.

Sorry, this product is not currently available to buy online. Please visit Shopping Help.

View bag and checkout
Remove item
✕

Are you sure you want to remove from your bag?

Recommended product

Popular links

Popular links

Algorithms on Strings

All titles
Algorithms on Strings

Algorithms on Strings

November 2014
Available
Paperback
9781107670990

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact [email protected] providing details of the course you are teaching.

    Description

    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

    September 2007
    Adobe eBook Reader
    9780511287329
    0 pages
    0kg
    This ISBN is for an eBook version which is distributed on our behalf by a third party.

    Often bought together

    125 Problems in Text Algorithms
    125 Problems in Text Algorithms

    : Hardback

    with Solutions

    125 Problems in Text Algorithms
    125 Problems in Text Algorithms

    : Paperback

    with Solutions

    Often bought together

    This title is available for institutional purchase via Cambridge Core

    Learn more
    cambridge core banner

    Related Journals

    Combinatorics, Probability and Computing
    Combinatorics, Probability and Computing

    : Journal

    Published bimonthly, Combinatorics, Probability & Computing is devoted to the three areas of combinatorics, probability theory and theoretical computer science. Topics covered include classical and algebraic graph theory, extremal set theory, matroid theory, probabilistic methods and random combinatorial structures; combinatorial probability and limit theorems for random combinatorial structures; the theory of algorithms (including complexity theory), randomised algorithms, probabilistic analysis of algorithms, computational learning theory and optimisation.

    The Review of Symbolic Logic
    The Review of Symbolic Logic

    : Journal

    The Review of Symbolic Logic is designed to cultivate research on theborders of logic, philosophy, and the sciences, and to supportsubstantive interactions between these disciplines. The journalwelcomes submissions in any of the following areas, broadly construed: - The general study of logical systems and their semantics,including non-classical logics and algebraic logic; - Philosophical logic and formal epistemology, including interactions with decision theory and game theory; - The history, philosophy, and methodology of logic and mathematics, including the history of philosophy of logic and mathematics; - Applications of logic to the sciences, such as computer science, cognitive science, and linguistics; and logical results addressing foundational issues in the sciences. The Review welcomes submissions in all these areas. (For informationon how to submit papers, see Guidelines below.) The Review beganpublication in June 2008.

    Mathematical Structures in Computer Science
    Mathematical Structures in Computer Science

    : Journal

    Mathematical Structures in Computer Science is a journal of theoretical computer science which focuses on the application of ideas from the structural side of mathematics and mathematical logic to computer science. The journal aims to bridge the gap between theoretical contributions and software design, publishing original papers of a high standard and broad surveys with original perspectives in all areas of computing, provided that ideas or results from logic, algebra, geometry, category theory or other areas of logic and mathematics form a basis for the work. The journal welcomes applications to computing based on the use of specific mathematical structures (e.g. topological and order-theoretic structures) as well as on proof-theoretic notions or results. The journal will also accept contributions in new interdisciplinary fields bridging computer science, quantum physics, mathematics and information theory. In particular, papers on quantum information processing and communication, as well as on the related issues in quantum language design will be considered. The journal is also interested in papers on computational modelling of epigenetics phenomena, protein-protein interaction, stochasticity in molecular cascades. Mathematical approches to System Biology will be welcomed, within the broad frame of post-genomic views of embryogenesis and evolution.

    Related Journals

    Also by this Author

    Contents

    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.
      • Show more
    Courses
    Resources
    Additional Information
    About the authors
      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.

    Accessibility

    Browse by related subject

     
    ✕

    Sorry, this item cannot be purchased in the same transaction as the existing items in your cart.

    Please complete the purchase of the items currently in your cart and then add this item in a separate transaction or contact

    Customer Services