Coverart for item
The Resource Algorithms on strings, trees, and sequences : computer science and computational biology, Dan Gusfield

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

Label
Algorithms on strings, trees, and sequences : computer science and computational biology
Title
Algorithms on strings, trees, and sequences
Title remainder
computer science and computational biology
Statement of responsibility
Dan Gusfield
Creator
Subject
Language
eng
Cataloging source
DLC
http://library.link/vocab/creatorName
Gusfield, Dan
Illustrations
illustrations
Index
index present
Literary form
non fiction
Nature of contents
bibliography
http://library.link/vocab/subjectName
  • Computer algorithms
  • Molecular biology
Label
Algorithms on strings, trees, and sequences : computer science and computational biology, Dan Gusfield
Instantiates
Publication
Note
Reprint, with corrections, of edition originally published 1997
Bibliography note
Includes bibliographical references (p. 505-523) and index
Contents
  • Preface
  • I.
  • Exact String Matching: The Fundamental String Problem.
  • p. 1
  • 1.
  • Exact Matching: Fundamental Preprocessing and First Algorithms.
  • p. 5
  • 2.
  • Exact Matching: Classical Comparison-Based Methods.
  • p. 16
  • 3.
  • Exact Matching: A Deeper Look at Classical Methods.
  • p. 35
  • 4.
  • Seminumerical String Matching.
  • p. 70
  • II.
  • Suffix Trees and Their Uses.
  • p. 87
  • 5.
  • Introduction to Suffix Trees.
  • p. 89
  • 6.
  • Linear-Time Construction of Suffix Trees.
  • p. 94
  • 7.
  • First Applications of Suffix Trees.
  • p. 122
  • 8.
  • Constant-Time Lowest Common Ancestor Retrieval.
  • p. 181
  • 9.
  • More Applications of Suffix Trees.
  • p. 196
  • III.
  • Inexact Matching, Sequence Alignment, Dynamic Programming.
  • p. 209
  • 10.
  • Importance of (Sub)sequence Comparison in Molecular Biology.
  • p. 212
  • 11.
  • Core String Edits, Alignments, and Dynamic Programming.
  • p. 215
  • 12.
  • Refining Core String Edits and Alignments.
  • p. 254
  • 13.
  • Extending the Core Problems.
  • p. 312
  • 14.
  • Multiple String Comparison - The Holy Grail.
  • p. 332
  • 15.
  • Sequence Databases and Their Uses - The Mother Lode.
  • p. 370
  • IV.
  • Currents, Cousins, and Cameos.
  • p. 393
  • 16.
  • Maps, Mapping, Sequencing, and Superstrings.
  • p. 395
  • 17.
  • Strings and Evolutionary Trees.
  • p. 447
  • 18.
  • Three Short Topics.
  • p. 480
  • 19.
  • Models of Genome-Level Mutations.
  • p. 492
  • Epilogue - where next?.
  • p. 501
  • Bibliography.
  • p. 505
  • Glossary.
  • p. 524
  • Index.
  • p. 530
Control code
r20000970715
Dimensions
26 cm.
Edition
Corrected reprint
Extent
xviii, 534 p.
Isbn
9780521585194
Lccn
lc96046612
Other physical details
ill.
Label
Algorithms on strings, trees, and sequences : computer science and computational biology, Dan Gusfield
Publication
Note
Reprint, with corrections, of edition originally published 1997
Bibliography note
Includes bibliographical references (p. 505-523) and index
Contents
  • Preface
  • I.
  • Exact String Matching: The Fundamental String Problem.
  • p. 1
  • 1.
  • Exact Matching: Fundamental Preprocessing and First Algorithms.
  • p. 5
  • 2.
  • Exact Matching: Classical Comparison-Based Methods.
  • p. 16
  • 3.
  • Exact Matching: A Deeper Look at Classical Methods.
  • p. 35
  • 4.
  • Seminumerical String Matching.
  • p. 70
  • II.
  • Suffix Trees and Their Uses.
  • p. 87
  • 5.
  • Introduction to Suffix Trees.
  • p. 89
  • 6.
  • Linear-Time Construction of Suffix Trees.
  • p. 94
  • 7.
  • First Applications of Suffix Trees.
  • p. 122
  • 8.
  • Constant-Time Lowest Common Ancestor Retrieval.
  • p. 181
  • 9.
  • More Applications of Suffix Trees.
  • p. 196
  • III.
  • Inexact Matching, Sequence Alignment, Dynamic Programming.
  • p. 209
  • 10.
  • Importance of (Sub)sequence Comparison in Molecular Biology.
  • p. 212
  • 11.
  • Core String Edits, Alignments, and Dynamic Programming.
  • p. 215
  • 12.
  • Refining Core String Edits and Alignments.
  • p. 254
  • 13.
  • Extending the Core Problems.
  • p. 312
  • 14.
  • Multiple String Comparison - The Holy Grail.
  • p. 332
  • 15.
  • Sequence Databases and Their Uses - The Mother Lode.
  • p. 370
  • IV.
  • Currents, Cousins, and Cameos.
  • p. 393
  • 16.
  • Maps, Mapping, Sequencing, and Superstrings.
  • p. 395
  • 17.
  • Strings and Evolutionary Trees.
  • p. 447
  • 18.
  • Three Short Topics.
  • p. 480
  • 19.
  • Models of Genome-Level Mutations.
  • p. 492
  • Epilogue - where next?.
  • p. 501
  • Bibliography.
  • p. 505
  • Glossary.
  • p. 524
  • Index.
  • p. 530
Control code
r20000970715
Dimensions
26 cm.
Edition
Corrected reprint
Extent
xviii, 534 p.
Isbn
9780521585194
Lccn
lc96046612
Other physical details
ill.

Library Locations

    • Harold Cohen LibraryBorrow it
      Ashton Street, Liverpool, L69 3DA, GB
      53.418074 -2.967913
Processing Feedback ...