Algorithms 2011, 4(1), 40-60; doi:10.3390/a4010040
Article

Edit Distance with Block Deletions

Dana Shapira 1,* email and James A. Storer 2 email
1 Ashkelon Academic College, 12 Ben-Tzvi Street, Ashkelon 78211, Israel 2 Brandeis University, 415 South Street, Waltham, MA 02453, USA
* Author to whom correspondence should be addressed.
Received: 30 January 2011; in revised form: 23 February 2011 / Accepted: 25 February 2011 / Published: 7 March 2011
PDF Full-text Download PDF Full-Text [440 KB, uploaded 7 March 2011 15:01 CET]
Abstract: 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 and block deletions is NP-complete (Nondeterministic Polynomial time problems in which any given solution to such problem can be verified in polynomial time, and any NP problem can be converted into it in polynomial time), and that it can be reduced to the problem of non-recursive block moves and block deletions within a constant factor.
Keywords: approximation algorithms; text processing; NP-Complete; edit-distance; dynamic programming; block operations

Article Statistics

Click here to load and display the download statistics.

Cite This Article

MDPI and ACS Style

Shapira, D.; Storer, J.A. Edit Distance with Block Deletions. Algorithms 2011, 4, 40-60.

AMA Style

Shapira D, Storer JA. Edit Distance with Block Deletions. Algorithms. 2011; 4(1):40-60.

Chicago/Turabian Style

Shapira, Dana; Storer, James A. 2011. "Edit Distance with Block Deletions." Algorithms 4, no. 1: 40-60.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert