Pages that link to "Item:Q2944502"
From MaRDI portal
The following pages link to The greedy algorithm for the minimum common string partition problem (Q2944502):
Displayed 11 items.
- Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← links)
- Approximating reversal distance for strings with bounded number of duplicates (Q868388) (← links)
- Efficient algorithms for the block edit problems (Q963999) (← links)
- Quick greedy computation for minimum common string partition (Q2015138) (← links)
- Permutation-constrained common string partitions with applications (Q2146123) (← links)
- The complexity of finding common partitions of genomes with predefined block sizes (Q2163952) (← links)
- Fixed-parameter tractability for the Tree Assembly problem (Q2232586) (← links)
- Solving the minimum common string partition problem with the help of ants (Q2363999) (← links)
- A NOTE ON COMPLEXITY OF GENETIC MUTATIONS (Q2890984) (← links)
- Quick Greedy Computation for Minimum Common String Partitions (Q3011861) (← links)
- (Q5009593) (← links)