Preview "Algorithms on Strings, Trees, and Sequences" in a new window.

Algorithms on Strings, Trees, and Sequences

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.


In The Press


About the Author


Read on Your Favourite Devices

to find out more



Ebook Permissions

to find out more

About this Ebook

File formats
This ebook is available in:
The publisher has not yet supplied format information.
Pre-order formats shown are based on publisher intent and may change before release.
File sizes shown are an approximation. The actual download size will vary based on the application you use to read the book.
Publisher
Published
; Copyright:
ISBNs
Title
Series
Author
;
Edition
Imprint
Language
Number of Pages
Page count shown is an approximation provided by the publisher. The actual page count will vary based on various factors such as your device's screen size and font-size.