Algorithms on Strings, Trees, and Sequences

Algorithms on Strings, Trees, and Sequences

Computer Science and Computational Biology

eBook - 1997
Rate this:
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.
Publisher: Cambridge ; New York : Cambridge University Press, 1997
ISBN: 9780521585194
Branch Call Number: DOWNLOADABLE E-BOOK
Characteristics: 1 online resource (1 v.) : ill
Additional Contributors: Safari Books Online

Opinion

From the critics


Community Activity

Comment

Add a Comment

There are no comments for this title yet.

Age Suitability

Add Age Suitability

There are no age suitabilities for this title yet.

Summary

Add a Summary

There are no summaries for this title yet.

Notices

Add Notices

There are no notices for this title yet.

Quotes

Add a Quote

There are no quotes for this title yet.

Explore Further

Subject Headings

  Loading...

Find it at RPL

  Loading...
[]
[]
To Top