13 citations · 30 across the 11 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DS2010
Unified Compression-Based Acceleration of Edit-Distance Computation
Danny Hermelin, Gad M. Landau, Shir Landau +1
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s…
cs.DS2010
Random Access to Grammar Compressed Strings
Philip Bille, Gad M. Landau, Rajeev Raman +3
Grammar based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures many popular…