Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology Dan Gusfield
Publisher: Cambridge University Press

Http://stackoverflow.com/questions/13603793/discovering-consecutive-repetitive-patterns-in-a-string . Computers and Intractibility: A Guide to the Theory of NP-Completeness. Algorithms on Strings <=====Tao=====> algorithms on strings， trees and sequences: computer science and computational biology. Algorithms On Strings Trees And Sequences - Gusfield.pdf. Algorithms on strings, trees, and sequences: computer science and computational biology. Algorithms On Strings, Trees And Sequences - Computer Science And Computational Biology [Cambridge-Press 1997.pdf. Handbook of Algorithms and Data Structures. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. The first description of these algorithms I could find are in the book Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, by Dan Gusfield. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology Download eBook Online. ǚ�概念，即一个字符串改变多少个字符可以变成另一个字符串；由俄罗斯人Vladimir Levenshtein提出。 In information theory and computer science, the Levenshtein distance is a metric for measuring the amount of difference between two sequences (i.e. Algorithms for finding palindromes in DNA. Search engine index merging is similar in concept to the SQL Merge command and other merge algorithms. Cambridge, UK: Cambridge University Press.