3 citations · 3 across the 1 of their papers we have counts for
1 paper · 2 filters
Raphaël Clifford, Paweł Gawrychowski, Tomasz Kociumaka +2
We show that the edit distance between two run-length encoded strings of compressed lengths m and n respectively, can be computed in O(mnlog(mn)) time. This improv…