Quick greedy computation for minimum common string partitions

DOI10.1007/978-3-642-21458-5_24MaRDI QIDQ3011861zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Quick greedy computation for minimum common string partition
• The greedy algorithm for the minimum common string partition problem
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Minimum common string partition problem: hardness and approximations
• Algorithms and Computation

Cites work

• A Space-Economical Suffix Tree Construction Algorithm
• Block edit models for approximate string matching
• Edit distance with move operations
• scientific article; zbMATH DE number 1516705 (Why is no real title available?)
• scientific article; zbMATH DE number 2119725 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2005
• Minimum common string partition problem: hardness and approximations
• Minimum common string partition revisited
• On-line construction of suffix trees
• Reversal distance for strings with duplicates: linear time approximation using hitting set
• Sorting strings by reversals and by transpositions
• The greedy algorithm for edit distance with moves
• The greedy algorithm for the minimum common string partition problem
• Transforming cabbage into turnip

Cited in

(10)

• ILP-based reduced variable neighborhood search for large-scale minimum common string partition
• Quick greedy computation for minimum common string partition
• Solving the minimum common string partition problem with the help of ants
• Mathematical programming strategies for solving the minimum common string partition problem
• The greedy algorithm for the minimum common string partition problem
• Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
• Minimum common string partition revisited
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• 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

This page was built for publication: Quick greedy computation for minimum common string partitions

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