Pages that link to "Item:Q2571293"

The following pages link to Minimum common string partition problem: hardness and approximations (Q2571293):

Displaying 21 items.

• Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← links)
• Minimum common string partition revisited (Q437061) (← links)
• Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
• On the kernelization complexity of string problems (Q1749539) (← 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)
• Revisiting the parameterized complexity of maximum-duo preservation string mapping (Q2210511) (← links)
• The complexity of string partitioning (Q2343298) (← links)
• Solving the minimum common string partition problem with the help of ants (Q2363999) (← links)
• Maximal strip recovery problem with gaps: hardness and approximation algorithms (Q2434927) (← links)
• The Complexity of String Partitioning (Q2904489) (← links)
• Quick Greedy Computation for Minimum Common String Partitions (Q3011861) (← links)
• On the Minimum Common Integer Partition Problem (Q3434560) (← links)
• Better Approximations for the Minimum Common Integer Partition Problem (Q3595391) (← links)
• A Retrospective on Genomic Preprocessing for Comparative Genomics (Q4992758) (← links)
• (Q5009593) (← links)
• Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable (Q5383967) (← links)
• Computational performance evaluation of two integer linear programming models for the minimum common string partition problem (Q5963700) (← links)
• Minimum common string partition: on solving large‐scale problem instances (Q6088232) (← links)
• Permutation-constrained common string partitions with applications (Q6647775) (← links)