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.
39 Kristoffer Sahlin, Thomas Baudeau, Bastien Cazaux, and Camille Marchet
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Revisiting $O(n \log \log n)$ chaining for anchored edit distance
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.