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 Dan Gusfield ebook
ISBN: 0521585198, 9780521585194
Page: 550
Format: djvu
Publisher: Cambridge University Press

ǚ概念，即一个字符串改变多少个字符可以变成另一个字符串；由俄罗斯人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. Research Interests Journal of Computational Biology, Dec 2005;12 (10):1261-74.. Algorithms on Strings, Trees and Sequences: Computer Science and. Blog / Algorithms and Computation, 12 conf., ISAAC 2001 e-book down on Algorithms and Computation MFCS -. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology Cambridge University Press, 1997. Last updated on 2012-12-17 by the dblp team List of computer science conferences - Wikipedia, the free. New York: Cambridge University Press; 1997. Rent or Buy Algorithms and Computation : Proceedings of the 11th. Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge, UK: Cambridge University Press. (1997) Algorithms on strings, trees and sequences: computer science and computational biology, Cambridge Univ. Gusfield D: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Share This; Tweet · Facebook · LinkedIn · Tumblr · Stumble · Digg · Delicious.