Fuzzy Hamming Distance: A New Dissimilarity Measure

Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . . . . . . . . . . . 31 Veli M¨akinen, Gonzalo Navarro, Esko Ukkonen What to Do with All this Hardware? (Invited Lecture) . . . . . . . . . . . . . . . . . 50 Uzi Vishkin Efficient Experimental String Matching by Weak Factor Recognition . . . . . 51 Cyril Allauzen, Maxime Crochemore, Mathieu Raffinot Better Filtering with Gapped q-Grams . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73 Stefan Burkhardt, Juha K¨arkk¨ainen Fuzzy Hamming Distance: A New Dissimilarity Measure d Abstract) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86 Abraham Bookstein, Shmuel Tomi Klein, Timo Raita An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture) 98 Aviezri S. Fraenkel, Jamie Simpson A Very Elementary Presentation of the Hannenhalli–Pe...

• Type: Conference
• Year: 2001
• Where: CPM
• Authors: Abraham Bookstein, Shmuel T. Klein, Timo Raita
• Keywords: Combinatorics, CPM 2001, Run-Length Compressed Strings, Shmuel Tomi, Wiseman Approximate Matching