Edit Distance with Block Deletions

Edit Distance with Block Deletions

Several variants of the edit distance problem with block deletions are considered. Polynomial time optimal algorithms are presented for the edit distance with block deletions allowing character insertions and character moves, but without block moves. We show that the edit distance with block moves a...

Full description

Bibliographic Details
Main Authors: Dana Shapira, James A. Storer
Format: Article
Language:English
Published: MDPI AG 2011-03-01
Series:Algorithms
Subjects:
approximation algorithms
text processing
NP-Complete
edit-distance
dynamic programming
block operations
Online Access:http://www.mdpi.com/1999-4893/4/1/40/

Internet

http://www.mdpi.com/1999-4893/4/1/40/

Similar Items