Quick greedy computation for minimum common string partition
From MaRDI portal
Publication:2015138
DOI10.1016/J.TCS.2014.05.006zbMATH Open1360.68963OpenAlexW2155896419MaRDI QIDQ2015138FDOQ2015138
Authors: Isaac Goldstein, Moshe Lewenstein 
Publication date: 23 June 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.05.006
Recommendations
- Quick greedy computation for minimum common string partitions
- The greedy algorithm for the minimum common string partition problem
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Exponential and polynomial time algorithms for the minimum common string partition problem
- Minimum common string partition problem: hardness and approximations
Cites Work
- Title not available (Why is that?)
- A Space-Economical Suffix Tree Construction Algorithm
- On-line construction of suffix trees
- Minimum common string partition problem: hardness and approximations
- The greedy algorithm for the minimum common string partition problem
- Minimum common string partition revisited
- Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
- Title not available (Why is that?)
- Reversal Distance for Strings with Duplicates: Linear Time Approximation Using Hitting Set
- Transforming cabbage into turnip
- Restricted common superstring and restricted common supersequence
- The greedy algorithm for edit distance with moves
- Sorting strings by reversals and by transpositions
- Mathematical Foundations of Computer Science 2005
- Block edit models for approximate string matching
- On the longest common rigid subsequence problem
- Edit distance with move operations
Cited In (4)
This page was built for publication: Quick greedy computation for minimum common string partition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015138)
