Cover image for Algorithms on strings, trees, and sequences : computer science and computational biology
Title:
Algorithms on strings, trees, and sequences : computer science and computational biology
Author:
Gusfield, Dan.
ISBN:
9780521585194
Personal Author:
Publication Information:
Cambridge [England] ; New York : Cambridge University Press, 2008.
Physical Description:
xviii, 534 p. : ill. ; 26 cm.
Holds:
Copies:

Available:*

Library
Material Type
Item Barcode
Call Number
Shelf Location
Status
Item Holds
Searching...
Book BILKUTUP0306052 QA76.9.A43 G87 2008 East Campus Library
Searching...

On Order

Summary

Summary

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.


Table of Contents

Part I Exact String Matching: The Fundamental String Problem
1 Exact matching: fundamental preprocessing and first algorithms
2 Exact matching: classical comparison-based methods
3 Exact matching: a deeper look at classical methods
4 Semi-numerical string matching
Part II Suffix Trees And Their Uses
5 Introduction to suffix trees
6 Linear time construction of suffix trees
7 First applications of suffix trees
8 Constant time lowest common ancestor retrieval
9 More applications of suffix trees
Part III Inexact Matching, Sequence Alignment, And Dynamic Programming
10 The importance of (sub)sequence comparison in molecular biology
11 Core string edits, alignments, and dynamic programming
12 Refining core string edits and alignments
13 Extending the core problems
14 Multiple string comparison: the Holy Grail
15 Sequence database and their uses: the motherlode
Part IV Currents, Cousins And Cameos
16 Maps, mapping, sequencing and superstrings
17 Strings and evolutionary trees
18 Three short topics
19 Models of genome-level mutations