Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison

Sankoff, David; Kruskal, Joseph

ISBN 10: 1575862174 / ISBN 13: 9781575862170

Published by Center for the Study of Language and Inf, 1999

About this Item

Satisfaction Guaranteed or your money back.

Seller Inventory # 1575862174

Bibliographic Details

• Title: Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison
• Publisher: Center for the Study of Language and Inf
• Publication Date: 1999
• Language: English
• ISBN 10: 1575862174
• ISBN 13: 9781575862170
• Binding: Soft cover
• Condition: New

About this title

Synopsis

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.

Book Description

Time Warps, String Edits and Macromolecules is a young classic in computational science, scientific analysis from a computational perspective. 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. The book contains lucid explanations of the basic techniques, well-annotated examples of applications, and mathematical analysis of its computational (algorithmic) complexity.