Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Algorithms on Strings
  • Cited by 231
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      October 2009
      April 2007
      ISBN:
      9780511546853
      9780521848992
      9781107670990
      DOI:
      https://doi.org/10.1017/CBO9780511546853
      Dimensions:
      (228 x 152 mm)
      Weight & Pages:
      0.74kg, 392 Pages
      Dimensions:
      (229 x 152 mm)
      Weight & Pages:
      0.52kg, 392 Pages
      • Subjects:
      Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Logic, Categories and Sets, Computer Science
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Mathematics, Algorithmics, Complexity, Computer Algebra, Computational Geometry, Logic, Categories and Sets, Computer Science
    Information

    Book description

    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.

    Reviews

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

    Source: 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.'

    Source: Mathematical Reviews

    Refine List

    Actions for selected content:

    Select all | Deselect all
    • View selected items
    • Export citations
    • Download PDF (zip)
    • Save to Kindle
    • Save to Dropbox
    • Save to Google Drive

    Save Search

    You can save your searches here and later view and run them again in "My saved searches".

    Please provide a title, maximum of 40 characters.
    Cancel
    ×

    Contents

    Contents

    Metrics

    Altmetric attention score

    Full text views

    Total number of HTML views: 0
    Total number of PDF views: 0 *
    Loading metrics...

    Book summary page views

    Total views: 0 *
    Loading metrics...

    * Views captured on Cambridge Core between #date#. This data will be updated every 24 hours.

    Usage data cannot currently be displayed.

    Accessibility standard: Unknown

    Why this information is here

    This section outlines the accessibility features of this content - including support for screen readers, full keyboard navigation and high-contrast display options. This may not be relevant for you.

    Accessibility Information

    Accessibility compliance for the PDF of this book is currently unknown and may be updated in the future.