DeepRead
Cover of Algorithms on Strings

Algorithms on Strings

Maxime Crochemore · 2007

Programming and computer science › Algorithms and coding interviews

#14,216 most recommended

About the book

A textbook on algorithms for processing strings, covering exact and approximate pattern matching, indexing structures such as suffix trees and suffix automata, and text compression. It presents the algorithms with their complexity analysis and applies them to problems in computational biology and text processing. The book holds that many string problems share a small set of underlying techniques, such as automata, periodicity, and suffix-based indexing, and that studying these techniques together is more useful than treating each problem separately. It treats correctness proofs and running-time analysis as part of the algorithms themselves. It also shows how the same tools carry over from simple pattern search to sequence comparison and biological data.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

02420122015202020252012 peak · 1
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.

  • 1 want to read
  • 0 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
2007
ISBN
9780521848992
Editions known
2 at Open Library
Open Library
OL14874096W

Computational biologyComputer algorithmsMatching theoryText processing (computer science)

Explore in the mosaic

Read next: its neighbours on the mosaic