Next Article in Journal
Compressed Matching in Dictionaries
Previous Article in Journal
Defense of the Least Squares Solution to Peelleā€™s Pertinent Puzzle
Algorithms 2011, 4(1), 40-60; doi:10.3390/a4010040
Article

Edit Distance with Block Deletions

1,*  and 2
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 / Revised: 23 February 2011 / Accepted: 25 February 2011 / Published: 7 March 2011
View Full-Text   |   Download PDF [440 KB, uploaded 7 March 2011]   |   Browse Figures

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 approximation algorithms; text processing; NP-Complete; edit-distance; dynamic programming; block operations
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Share & Cite This Article

Further Mendeley | CiteULike
Export to BibTeX |
EndNote
MDPI and ACS Style

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

View more citation formats

Article Metrics

For more information on the journal, click here

Comments

Cited By

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert