36 citations · 78 across the 32 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014
Covering Problems for Partial Words and for Indeterminate Strings
Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka +3
We consider the problem of computing a shortest solid cover of an indeterminate string. An indeterminate string may contain non-solid symbols, each of which specifies a subset of t…
cs.DS2014
On the String Consensus Problem and the Manhattan Sequence Consensus Problem
Tomasz Kociumaka, Jakub W. Pachocki, Jakub Radoszewski +2
In the Manhattan Sequence Consensus problem (MSC problem) we are given integer sequences, each of length , and we are to find an integer sequence of length (called a…