Pages that link to "Item:Q2571293"

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

Displaying 3 items.

• Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← links)
• Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
• On the kernelization complexity of string problems (Q1749539) (← links)