Publication:4737692
From MaRDI portal
zbMath1077.68744MaRDI QIDQ4737692
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2373/23730085.htm
68Q25: Analysis of algorithms and problem complexity
68W05: Nonnumerical algorithms
68R15: Combinatorics on words
Related Items
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, Minimum common string partition revisited, Bounding prefix transposition distance for strings and permutations, Approximating reversal distance for strings with bounded number of duplicates, Efficient algorithms for the block edit problems, Alignments with non-overlapping moves, inversions and tandem duplications in \(O(n^{4})\) time, The greedy algorithm for edit distance with moves, Mathematical programming strategies for solving the minimum common string partition problem, Sorting by Transpositions Is Difficult