pith. sign in

and Mikheenko, Alla and Vollger, Mitchell R

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it

years

2026 3

verdicts

UNVERDICTED 3

representative citing papers

Revisiting $O(n \log \log n)$ chaining for anchored edit distance

cs.DS · 2026-06-02 · unverdicted · novelty 7.0

An O(n log log n) time O(n) space algorithm for anchored edit distance chaining is obtained by merging gap-cost computation from Chao and Miller (1995) with overlap-cost computation from Baker and Giancarlo (1998), plus a practical O(n log n) implementation.

citing papers explorer

Showing 3 of 3 citing papers.