scientific article; zbMATH DE number 2087046

zbMath1077.68744MaRDI QIDQ4737692

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (10)

Mathematical programming strategies for solving the minimum common string partition problem ⋮ Approximating reversal distance for strings with bounded number of duplicates ⋮ Minimum common string partition: on solving large‐scale problem instances ⋮ Minimum common string partition revisited ⋮ Sorting by Transpositions Is Difficult ⋮ Efficient algorithms for the block edit problems ⋮ Computational performance evaluation of two integer linear programming models for the minimum common string partition problem ⋮ Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time ⋮ Bounding prefix transposition distance for strings and permutations ⋮ The greedy algorithm for edit distance with moves

This page was built for publication: