Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce

The edit distance between two strings is defined as the smallest number of insertions , deletions , and substitutions that need to be made to transform one of the strings to another one. Approximating edit distance in subquadratic time is “one of the biggest unsolved problems in the field of combina...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of the ACM 2021-06, Vol.68 (3), p.1-41
Hauptverfasser:	Boroujeni, Mahdi, Ehsani, Soheil, Ghodsi, Mohammad, Hajiaghayi, Mohammadtaghi, Seddighin, Saeed
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Combinatorial analysis Pattern matching Strings
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!