DeepRead
Cover of Algorithms on strings, trees, and sequences

Algorithms on strings, trees, and sequences

Dan Gusfield · 1997

Programming and computer science › Algorithms and coding interviews

#6,036 most recommended

About the book

A textbook on algorithms for strings, trees, and sequences, with a focus on problems in computational biology. It covers exact and approximate string matching, suffix trees and suffix arrays, dynamic programming for sequence comparison and alignment, and tree algorithms used in phylogenetics and related areas of molecular biology. The book contends that many problems in computer science and in molecular biology reduce to a shared set of string and tree techniques, so one toolkit can serve both fields. It presents the suffix tree as a central, versatile structure that solves a wide range of pattern and sequence problems in linear or near-linear time. It also argues that biological sequence comparison is best understood through precise algorithmic formulations such as edit distance and alignment, and that biologists and computer scientists benefit from a common treatment of these methods.

Written by Claude from what it knows of this book.

What Hacker News says 50% recommend · 0% critical

02420122015202020252012 peak · 3
This bookAverage book in Algorithms and coding interviews

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 6 want to read
  • 1 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
1997
ISBN
9780521585194
Editions known
6 at Open Library
Open Library
OL3348486W

005.7/31997 i-920AlgorithmsComputational biologyComputer algorithmsData processingElectronic data processingMolecular biologyMolecular biology--data processingQa 76.9.a43 g982a 1997Qa76.9.a43 g87 1997Sequence analysis

Explore in the mosaic

Read next: its neighbours on the mosaic