Efficient algorithms for the block edit problems
From MaRDI portal
Publication:963999
DOI10.1016/j.ic.2009.12.001zbMath1187.68176OpenAlexW2002423246MaRDI QIDQ963999
Bern-Cherng Liaw, Hsing-Yen Ann, Yung-Hsing Peng, Chang-Biau Yang
Publication date: 14 April 2010
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2009.12.001
Related Items
Fast computation of a string duplication history under no-breakpoint-reuse ⋮ An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints ⋮ Efficient polynomial-time algorithms for the constrained LCS problem with strings exclusion ⋮ Edit distance with block deletions ⋮ Finding the gapped longest common subsequence by incremental suffix maximum queries
Cites Work
- Dynamic programming algorithms for the mosaic longest common subsequence problem
- The greedy algorithm for edit distance with moves
- Block edit models for approximate string matching
- Simple and fast linear space computation of longest common subsequences
- Efficient algorithms for finding interleaving relationship between sequences
- Longest common subsequence between run-length-encoded strings: a new algorithm with improved parallelism
- Edit distance with move operations
- The greedy algorithm for the minimum common string partition problem
- Approximate nearest neighbors and sequence comparison with block operations
- Algorithms for approximate string matching
- A fast algorithm for computing longest common subsequences
- Fast Pattern Matching in Strings
- Algorithms for the Longest Common Subsequence Problem
- Fast parallel and serial approximate string matching
- Algorithms on Strings, Trees and Sequences
- The String-to-String Correction Problem
- Error Detecting and Error Correcting Codes
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- String Processing and Information Retrieval
- Unnamed Item
- Unnamed Item
- Unnamed Item
