Seminar – Fall-2003 , Wednesday,
10-12
Apostolico, A., G. M. Landau, and
Arbell, O., G.M. Landau and J.S.B. Mitchell, Edit distance of run length encoded strings. Information Processing Letters, 83,6,307-314 (2002)
Veli Mkinen, Esko Ukkonen, Gonzalo Navarro: Approximate Matching of Run length Compressed Strings, Algorithmica, 35, 4, 347-369 (2003).
Crochemore, M., G.M. Landau and M. Ziv-Ukelson, A Sub quadratic sequence alignment algorithm for unrestricted scoring matrices, SIAM J. Comput., to appear.
Claus Rick, Simple and Fast Linear Space Computation of Longest Common Subsequences, Information Processing Letters, 75, 6, 275-281 (2000)
Speaker: Oren Weimann
Stefan Burkhardt, Juha Krkkinen, Fast Lightweight Suffix Array Construction and Checking, Proc. 14 Combinatorial Pattern Matching Conference, Lecture Notes in Computer Science 2676, Springer-Verlag, 55-69 (2003).
Workshop.
Dong Kyue Kim, Jeong Seop Sim,
Pang Ko and Srinivas Aluru, Space Efficient Linear Time Construction of Suffix Arrays, Proc. 14 Combinatorial Pattern Matching Conference, Lecture Notes in Computer Science 2676, Springer-Verlag, 200-210 (2003).