scientific article; zbMATH DE number 2087046

MaRDI QIDQ4737692zbMATH OpenFDO

Authors Dana Shapira, James A. Storer

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2373/23730085.htm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Nonnumerical algorithms (68W05)

Recommendations

• Edit distance with move operations
• Large edit distance with multiple block operations.
• scientific article; zbMATH DE number 2119725
• The string edit distance matching problem with moves
• Edit distance with block deletions

Cited in

(17)

• Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time
• The greedy algorithm for edit distance with moves
• Edit distance with block deletions
• Edit distance with move operations
• Mathematical programming strategies for solving the minimum common string partition problem
• The string edit distance matching problem with moves
• Minimum common string partition revisited
• Charge and reduce: A fixed-parameter algorithm for string-to-string correction
• scientific article; zbMATH DE number 2119725 (Why is no real title available?)
• Large edit distance with multiple block operations.
• Computational performance evaluation of two integer linear programming models for the minimum common string partition problem
• Minimum common string partition: on solving large‐scale problem instances
• Efficient algorithms for computing the edit distance with non-overlapping inversions
• Bounding prefix transposition distance for strings and permutations
• Approximating reversal distance for strings with bounded number of duplicates
• An algorithm with linear expected running time for string editing with substitutions and substring reversals
• Efficient algorithms for the block edit problems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737692)