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

Published
  • Cambridge [England] ; New York : Cambridge University Press 1997
Physical description
xviii, 534 pages : illustrations ; 26 cm
ISBN
  • 0521585198
  • 9780521585194
Local notes
  • Legacy (2018) (UoY)
Notes
  • Includes bibliographical references (pages 505-523) and index.
Contents
  • Exact matching: fundamental preprocessing and first algorithms -- Exact matching: classical comparison-based methods -- Exact matching: a deeper look at classical methods -- Seminumerical string matching -- Introduction to suffix trees -- Linear-time construction of suffix trees -- First applications of suffix trees -- Constant-time lowest common ancestor retrieval -- More applications of suffix trees -- 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 databases and their uses- The Mother Lode -- Maps, mapping, sequencing, and superstrings -- Strings and evolutionary trees -- Three short topics -- Models of Genome-level mutations.
Related item
  • http://catdir.loc.gov/catdir/description/cam028/96046612.html
Genre
  • Bibliography
  • Illustrated
  • text
Language
  • English
Related Internet Resources
  • Publisher Description (unedited publisher data) 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. Library of Congress subject headings for this publication: Computer algorithms, Bioinformatics, Molecular biology Data processing.

Holdings information at the University of Bristol Libraries

Live circulation data is not available.

Location of copy Shelfmark Availability
Queen's Building Library QA76.9.A43 GUS
7 day loan: vacation loan

Link to external resource:

Link to external resource:

More details about: University of Bristol Libraries

Algorithms on Strings, Trees and Sequences : Computer Science and Computational Biology / Dan Gusfield.

Published
  • Cambridge : Cambridge University Press 1997
Physical description
1 online resource (556 pages)
ISBN
  • 9780511574931
  • 0511574932
  • 9780521585194
  • 0521585198
  • 9781139811484
  • 1139811487
Notes
  • Title from publishers bibliographic system (viewed 22 Dec 2011).
  • Includes bibliographical references (pages 505-523) and index.
Contents
  • Cover -- Half-title -- Title -- Copyright -- Dedication -- Contents -- Preface -- I Exact String Matching: The Fundamental String Problem -- 1 Exact Matching: Fundamental Preprocessing and First Algorithms -- 1.1 The naive method -- 1.1.1. Early ideas for speeding up the naive method -- 1.2 The preprocessing approach -- 1.3 Fundamental preprocessing of the pattern -- 1.4 Fundamental preprocessing in linear time -- The Z algorithm -- 1.5 The simplest linear-time exact matching algorithm -- 1.5.1. Why continue? -- 1.6 Exercises -- A digression on circular strings in DNA.
  • 2 Exact Matching: Classical Comparison-Based Methods -- 2.1 Introduction -- 2.2 The Boyer-Moore Algorithm -- 2.2.1. Right-to-left scan -- 2.2.2. Bad character rule -- 2.2.3. The (strong) good suffix rule -- 2.2.4. Preprocessing for the good suffix rule -- 2.2.5. The good suffix rule in the search stage of Boyer-Moore -- 2.2.6. The complete Boyer-Moore algorithm -- 2.3 The Knuth-Morris-Pratt algorithm -- 2.3.1. The Knuth-Morris-Pratt shift idea -- The Knuth-Morris-Pratt shift rule -- 2.3.2. Preprocessing for Knuth-Morris-Pratt -- 2.3.3. A full implementation of Knuth-Morris-Pratt.
  • 2.4 Real-time string matching -- 2.4.1. Converting Knuth-Morris-Pratt to a real-time method -- 2.4.2. Preprocessing for real-time string matching -- 2.5 Exercises -- 3 Exact Matching: A Deeper Look at Classical Methods -- 3.1 A Boyer-Moore variant with a ""simple"" linear time bound -- 3.1.1. Key ideas -- 3.1.2. One phase in detail -- 3.1.3. Correctness and linear-time analysi -- 3.2 Cole's linear worst-case bound for Boyer-Moore -- 3.2.1. Cole's proof when the pattern does not occur in the text -- 3.2.2. The case when the pattern does occur in the text -- 3.2.3. Adding in the bad character rule.
  • 3.3 The original preprocessing for Knuth-Morris-Pratt -- 3.3.1. The method does not use fundamental preprocessing -- 3.3.2. The easy case -- 3.3.3. The general case -- 3.3.4. How to compute the optimized shift values -- 3.4 Exact matching with a set of patterns -- 3.4.1. Naive use of keyword trees for set matching -- 3.4.2. The speedup: generalizing Knuth-Morris-Pratt -- 3.4.3. Failure functions for the keyword tree -- 3.4.4. The failure links speed up the search -- 3.4.5. Linear preprocessing for the failure function -- 3.4.6. The full Aho-Corasick algorithm: relaxing the substring assumption.
  • 3.5 Three applications of exact set matching -- 3.5.1. Matching against a DNA or protein library of known patterns -- 3.5.2. Exact matching with wild cards -- 3.5.3. Two-dimensional exact matching -- 3.6 Regular expression pattern matching -- 3.6.1. Formal definitions -- 3.7 Exercises -- 4 Seminumerical String Matching -- 4.1 Arithmetic versus comparison-based methods -- 4.2 The Shift-And method -- 4.2.1. How to construct array M -- 4.2.2. Shift-And is effective for small patterns -- 4.2.3. agrep: The Shift-And method with errors -- 4.2.4. How to compute Mk.
Related item
Genre
  • Bibliography
  • Electronic books.
  • text
Language
  • English
  • This 1997 book describes a range of string problems in computer science and molecular biology and the algorithms developed to solve them.

Holdings information at the University of Bristol Libraries

Live circulation data is not available.

Link to external resource:

Link to external resource:

Link to external resource:

Resource Link: https://doi.org/10.1017/CBO9780511574931 ; Connect to e-book

Link to external resource:

Resource Link: http://www.survey.bris.ac.uk/standrews/cambridgebooksonlinetrial ; We have trial access to this e-book until 31/7/2012 through our Cambridge Books Online trial of over 12,000 titles. Please tell us if you would like to recommend continued access to it

More details about: University of Bristol Libraries

Export: