Optimal Algorithms for Bounded Weighted Edit Distance

The edit distance (also known as Levenshtein distance) of two strings is the minimum number of insertions, deletions, and substitutions of characters needed to transform one string into the other. The textbook dynamic-programming algorithm computes the edit distance of two length- n strings in \math...

Full description

Bibliographic Details

Published in:	Proceedings / annual Symposium on Foundations of Computer Science pp. 2177 - 2187
Main Authors:	Cassis, Alejandro, Kociumaka, Tomasz, Wellnitz, Philip
Format:	Conference Proceeding
Language:	English
Published:	IEEE 06.11.2023
Subjects:	Complexity theory Computer science conditional lower bounds edit distance Heuristic algorithms string algorithms Time complexity Transforms
ISSN:	2575-8454
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!