Algorithms on strings, trees, and sequences : computer science and computational biology / Dan Gusfield.

Author
Other titles
  • Algorithms on Strings, Trees & Sequences
Published
  • Cambridge : Cambridge University Press 1997
Physical description
1 online resource (xviii, 534 pages) : digital, PDF file(s).
ISBN
  • 1-107-19214-5
  • 1-139-81148-7
  • 0-511-57493-2
  • 1-139-81173-8
  • 0-511-96965-1
  • 1-283-87079-7
  • 1-139-81160-6
Notes
  • English
  • Includes bibliographical references and index.
  • Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Contents
  • pt. 1. Exact string matching : the fundamental string problem -- pt. 2. Suffix trees and their uses -- pt. 3. Inexact matching, sequence alignment, dynamic programing -- pt. 4. Currents, cousins, and cameos.
Related item
Genre
  • text
Language
  • English
  • 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 1997 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.

Holdings information at Cardiff University Libraries

Requesting live circulation data...

More details about: Cardiff University Libraries

Export: