Theoretical Analysis of Edit Distance Algorithms-Reference-Cited by-同舟云学术

Theoretical Analysis of Edit Distance Algorithms

Published:2023-11-17 Issue:12 Volume:66 Page:64-71
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Medvedev Paul¹

Affiliation:

1. Pennsylvania State University, University Park, PA, USA

Abstract

To what extent have the techniques for theoretical analysis of edit distance algorithms achieved their goals?

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/3582490

Reference45 articles.

1. Abboud , A. , Backus , A. , and Williams , V.V . Tight hardness results for LCS and other sequence similarity measures . In Proceedings of the 2015 IEEE 56th Annual Symp. Foundations of Computer Science, 59--78 . Abboud, A., Backus, A., and Williams, V.V. Tight hardness results for LCS and other sequence similarity measures. In Proceedings of the 2015 IEEE 56th Annual Symp. Foundations of Computer Science, 59--78.

2. Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made

3. Shouji: a fast and efficient pre-alignment filter for sequence alignment

4. The smoothed complexity of edit distance

5. Edit distance of run-length encoded strings

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graph Deep Active Learning Framework for Data Deduplication;Big Data Mining and Analytics;2024-09

2. Signal matching with modified edit distance based on aperiodic coding;2024 International Conference on Optoelectronic Information and Optical Engineering (OIOE 2024);2024-06-03

3. Exact global alignment using A* with chaining seed heuristic and match pruning;Bioinformatics;2024-01-23