Amazon cover image
Image from Amazon.com
Image from Google Jackets

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

By: Material type: TextTextPublication details: Cambridge [England] ; New York : Cambridge University Press, 1997.Description: xviii, 534 p. : ill. ; 26 cmISBN:
  • 0521585198
Subject(s): DDC classification:
  • 005.73   22
Contents:
Exact String Matching: The Fundamental String Problem -- Exact matching: fundamental preprocessing and first algorithms -- Exact matching: classical comparison-based methods -- Exact matching: a deeper look at classical methods -- Semi-numerical string matching -- Suffix Trees and their Uses: 5. Introduction to suffix trees -- Linear time construction of suffix -- First applications of suffix trees trees -- Constant time lowest common ancestor retrieval -- Inexact Matching, Sequence Alignment and Dynamic Programming -- The importance of (sub)sequence comparison in molecular biology -- Core string edits, alignments and dynamic programming -- Refining core string edits and alignments -- Extending the core problems -- Multiple string comparison: the Holy Grail Sequence database and their uses: the motherlode -- Currents, Cousins and Cameos -- Maps, mapping, sequencing and superstrings -- Strings and evolutionary trees -- Three short topics -- Models of genome-level mutations
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Copy number Status Date due Barcode
Books Books Main library General Stacks 005.73 / GU.A 1997 (Browse shelf(Opens below)) 1 Available 000765

Includes bibliographical references (p. 505-523) and index.

Exact String Matching: The Fundamental String Problem -- Exact matching: fundamental preprocessing and first algorithms -- Exact matching: classical comparison-based methods -- Exact matching: a deeper look at classical methods -- Semi-numerical string matching -- Suffix Trees and their Uses: 5. Introduction to suffix trees -- Linear time construction of suffix -- First applications of suffix trees trees -- Constant time lowest common ancestor retrieval -- Inexact Matching, Sequence Alignment and Dynamic Programming -- The importance of (sub)sequence comparison in molecular biology -- Core string edits, alignments and dynamic programming -- Refining core string edits and alignments -- Extending the core problems -- Multiple string comparison: the Holy Grail Sequence database and their uses: the motherlode -- Currents, Cousins and Cameos -- Maps, mapping, sequencing and superstrings -- Strings and evolutionary trees -- Three short topics -- Models of genome-level mutations

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.

1

There are no comments on this title.

to post a comment.