by David Sankoff and Joseph Kruskal
CSLI, 1983
Paper: 978-1-57586-217-0 | eISBN: 978-1-57586-711-3
Library of Congress Classification QA292.T55 1999
Dewey Decimal Classification 515.24

Time Warps, String Edits and Macromolecules is a young classic in computational science. The computational perspective is that of sequence processing, in particular the problem of recognizing related sequences. The book is the first, and still best compilation of papers explaining how to measure distance between sequences, and how to compute that measure effectively. This is called string distance, Levenshtein distance, or edit distance. The book contains lucid explanations of the basic techniques; well-annotated examples of applications; mathematical analysis of its computational (algorithmic) complexity; and extensive discussion of the variants needed for weighted measures, timed sequences (songs), applications to continuous data, comparison of multiple sequences and extensions to tree-structures. This theory finds applications in molecular biology, speech recognition, analysis of bird song and error correcting in computer software.

See other books on: Computational complexity | inf | Mathematical & Computational | Molecular biology | Theory Practice
See other titles from CSLI