Skip to main content Accessibility help
×
  1. Home
  2. Books
  3. Algorithms on Strings, Trees, and Sequences
  • Cited by 2494
      • Show more authors
      • You may already have access via personal or institutional login
    • Select format
    • Publisher:
      Cambridge University Press
      Publication date:
      June 2010
      May 1997
      ISBN:
      9780511574931
      9780521585194
      DOI:
      https://doi.org/10.1017/CBO9780511574931
      Dimensions:
      (253 x 177 mm)
      Weight & Pages:
      1.09kg, 556 Pages
      Dimensions:
      Weight & Pages:
      • Subjects:
      Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Computational Biology and Bioinformatics
    You may already have access via personal or institutional login
    • Selected: Digital
    Add to cart View cart Buy from Cambridge.org
    Subjects:
    Algorithmics, Complexity, Computer Algebra, Computational Geometry, Computer Science, Computational Biology and Bioinformatics
    Information

    Book description

    String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This book is a general text on computer algorithms for string processing. In addition to pure computer science, the book contains extensive discussions on biological problems that are cast as string problems, and on methods developed to solve them. It emphasises the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatics. Its discussion of current algorithms and techniques also makes it a reference for professionals.

    Reviews

    ‘The readers of this book will be serious programmers, but of course anybody working in bio-computing will find the book of immense practical, scientific and commercial importance … you should get the book, whether you want to do some string processing, fundamental computing research, or want to impress a biotech firm.’

    Harold Thimbleby Source: The Times Higher Education Supplement

    ‘… could well be used as the basis for a graduate-level course, particularly as it contains over 400 exercises to reinforce presented material and to develop further topics. It is recommended most highly.’

    P. Gibbons Source: Zentralblatt für Mathematik

    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.