Quick Greedy Computation for Minimum Common String Partitions

DOI10.1007/978-3-642-21458-5_24zbMath1339.68332OpenAlexW2181009307MaRDI QIDQ3011861

Isaac Goldstein, Moshe Lewenstein

Publication date: 29 June 2011

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21458-5_24

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (4)

Mathematical programming strategies for solving the minimum common string partition problem ⋮ Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization ⋮ Minimum common string partition: on solving large‐scale problem instances ⋮ Computational performance evaluation of two integer linear programming models for the minimum common string partition problem

Cites Work

• Unnamed Item
• Unnamed Item
• Reversal distance for strings with duplicates: linear time approximation using hitting set
• The greedy algorithm for edit distance with moves
• Block edit models for approximate string matching
• On-line construction of suffix trees
• Edit distance with move operations
• Minimum common string partition problem: hardness and approximations
• Sorting Strings by Reversals and by Transpositions
• The greedy algorithm for the minimum common string partition problem
• Transforming cabbage into turnip
• Minimum Common String Partition Revisited
• A Space-Economical Suffix Tree Construction Algorithm
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Quick Greedy Computation for Minimum Common String Partitions