We consider a problem defined on strings and inspired by the way DNA encodes amino-acids as triplets of nucleotides. Given a string s on an alphabet Σ, a word-length k and a budget D, we want to determine the smallest number of distinct k-mers that can be left in s, if we are allowed to replace up to D letters of s. This problem has several parameters, and we discuss its complexity under all sorts of restrictions on the parameters values. We prove that some versions of the problem are polynomial, while the others are NP-hard
AbstractWe are concerned with the complexity of deciding the avoidability of sets of partial words o...
When haplotyping a single individual, DNA is replicated, broken into smaller fragments, and then seq...
AbstractA fold of a finite string S over a given alphabet is an embedding of S in some fixed infinit...
Abstract. We consider a problem defined on strings and inspired by the way DNA encodes amino-acids a...
Given a string s on an alphabet Sigma, a word-length k and a budget D, we want to determine the smal...
We consider the following problem: given a collection of strings s 1;...; s m, nd the shortest stri...
AbstractWe show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet l...
AbstractVarious versions of the shortest common superstring problem play important roles in data com...
We consider the problem of constructing strings over an alphabet Σ that start with a given prefix u,...
formulations will be presented, followed by some simple algorithms for generating non-optimal soluti...
Abstract. Given a string w over a finite alphabet Σ and an integer K, can w be partitioned into stri...
Abstract. Motivated by the study of genome rearrangements, the NP-hard Minimum Common String Partiti...
Abstract. Motivated by the study of genome rearrangements, the NP-hard Minimum Common String Partiti...
Suppose that one has a list of words. What is the smallest string of letters needed to exhibit all o...
Abstract: The problem of reconstructing words from its subwords is is due to Schützenberger and Sim...
AbstractWe are concerned with the complexity of deciding the avoidability of sets of partial words o...
When haplotyping a single individual, DNA is replicated, broken into smaller fragments, and then seq...
AbstractA fold of a finite string S over a given alphabet is an embedding of S in some fixed infinit...
Abstract. We consider a problem defined on strings and inspired by the way DNA encodes amino-acids a...
Given a string s on an alphabet Sigma, a word-length k and a budget D, we want to determine the smal...
We consider the following problem: given a collection of strings s 1;...; s m, nd the shortest stri...
AbstractWe show that the fixed alphabet shortest common supersequence (SCS) and the fixed alphabet l...
AbstractVarious versions of the shortest common superstring problem play important roles in data com...
We consider the problem of constructing strings over an alphabet Σ that start with a given prefix u,...
formulations will be presented, followed by some simple algorithms for generating non-optimal soluti...
Abstract. Given a string w over a finite alphabet Σ and an integer K, can w be partitioned into stri...
Abstract. Motivated by the study of genome rearrangements, the NP-hard Minimum Common String Partiti...
Abstract. Motivated by the study of genome rearrangements, the NP-hard Minimum Common String Partiti...
Suppose that one has a list of words. What is the smallest string of letters needed to exhibit all o...
Abstract: The problem of reconstructing words from its subwords is is due to Schützenberger and Sim...
AbstractWe are concerned with the complexity of deciding the avoidability of sets of partial words o...
When haplotyping a single individual, DNA is replicated, broken into smaller fragments, and then seq...
AbstractA fold of a finite string S over a given alphabet is an embedding of S in some fixed infinit...
Add to ORKG