The string edit distance matching problem with moves
From MaRDI portal
Publication:2944538
DOI10.1145/1186810.1186812zbMath1321.68551OpenAlexW1982055477MaRDI QIDQ2944538
No author found.
Publication date: 2 September 2015
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1186810.1186812
Related Items (22)
Sketching and Embedding are Equivalent for Norms ⋮ Mathematical programming strategies for solving the minimum common string partition problem ⋮ Parameterized tractability of the maximum-duo preservation string mapping problem ⋮ Grammar index by induced suffix sorting ⋮ Fingerprints in compressed strings ⋮ Can formal languages help pangenomics to represent and analyze multiple genomes? ⋮ Signed rearrangement distances considering repeated genes, intergenic regions, and indels ⋮ Weak inverse neighborhoods of languages ⋮ Minimum common string partition: on solving large‐scale problem instances ⋮ Fast computation of a string duplication history under no-breakpoint-reuse ⋮ Unnamed Item ⋮ Revisiting the parameterized complexity of maximum-duo preservation string mapping ⋮ Edit distance with block deletions ⋮ siEDM: an efficient string index and search algorithm for edit distance with moves ⋮ Real-valued embeddings and sketches for fast distance and similarity estimation ⋮ A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem ⋮ Computational performance evaluation of two integer linear programming models for the minimum common string partition problem ⋮ On the decidability of finding a positive ILP-instance in a regular set of ILP-instances ⋮ Bounding prefix transposition distance for strings and permutations ⋮ Unnamed Item ⋮ A Space-Optimal Grammar Compression. ⋮ A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem
This page was built for publication: The string edit distance matching problem with moves
