Efficient algorithms for the block edit problems

Authors:
Hsing-Yen Ann;Chang-Biau Yang;Yung-Hsing Peng;Bern-Cherng Liaw
Affiliations:
Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung 80424, Taiwan;Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung 80424, Taiwan;Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung 80424, Taiwan;Department of Finance and Banking, National Pingtung Institute of Commence, Pingtung, Taiwan
Venue:
Information and Computation
Year:
2010

Citing 18
Cited 2

Algorithms for approximate string matching

Information and Control
Fast parallel and serial approximate string matching

Journal of Algorithms
Block edit models for approximate string matching

Theoretical Computer Science - Special issue: Latin American theoretical informatics
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Approximate string matching: a simpler faster algorithm

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The String-to-String Correction Problem

Journal of the ACM (JACM)
Algorithms for the Longest Common Subsequence Problem

Journal of the ACM (JACM)
Approximate nearest neighbors and sequence comparison with block operations

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A fast algorithm for computing longest common subsequences

Communications of the ACM
Simple and fast linear space computation of longest common subsequences

Information Processing Letters
Edit Distance with Move Operations

CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism

Information Processing Letters
The greedy algorithm for the minimum common string partition problem

ACM Transactions on Algorithms (TALG)
Dynamic programming algorithms for the mosaic longest common subsequence problem

Information Processing Letters
Edit distance with move operations

Journal of Discrete Algorithms
Efficient algorithms for finding interleaving relationship between sequences

Information Processing Letters
Linear pattern matching algorithms

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
The greedy algorithm for edit distance with moves

Information Processing Letters

Fast computation of a string duplication history under no-breakpoint-reuse

SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Efficient algorithms for the longest common subsequence problem with sequential substring constraints

Journal of Complexity

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we focus on the edit distance between two given strings where block-edit operations are allowed and better fitting to the human natural edit behaviors. Previous results showed that this problem is NP-hard when block moves are allowed. Various approximations to this problem have been proposed in recent years. However, this problem can be solved by the polynomial-time optimization algorithms if some reasonable restrictions are applied. The restricted variations which we consider involve character insertions, character deletions, block copies and block deletions. In this paper, three problems are defined with different measuring functions, which are P(EIS,C), P(EI,L) and P(EI,N). Then we show that with some preprocessing, the minimum block edit distances of these three problems can be obtained by dynamic programming in O(nm), O(nmlogm) and O(nm^2) time, respectively, where n and m are the lengths of the two input strings.