30 citations · 100 across the 41 of their papers we have counts for
Showing 2013 · cs.DSShow all
2 papers · 2 filters
cs.DS2013★ 1 cited
A Fixed-Parameter Algorithm for Minimum Common String Partition with Few Duplications
Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz +1
Motivated by the study of genome rearrangements, the NP-hard Minimum Common String Partition problems asks, given two strings, to split both strings into an identical set of blocks…
cs.DS2013
Minimum Common String Partition Parameterized by Partition Size is Fixed-Parameter Tractable
Laurent Bulteau, Christian Komusiewicz
The NP-hard Minimum Common String Partition problem asks whether two strings and can each be partitioned into at most substrings, called blocks, such that both partitio…