Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao. Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard. In Gregory Kucherov, Esko Ukkonen, editors, Combinatorial Pattern Matching, 20th Annual Symposium, CPM 2009, Lille, France, June 22-24, 2009, Proceedings. Volume 5577 of Lecture Notes in Computer Science, pages 168-179, Springer, 2009. [doi]
Abstract is missing.