Add to ORKGAbstract: The problem of reconstructing words from its subwords is is due to Schützenberger and Simon: for given n and alphabet size t, what is the smallest k such that every word of length at most n is uniquely determined by its different subwords of length at most k. Levenshtein [4] and Lothaire [6] proved that k = ⌈n+12 ⌉ for every t, which bound is sharp for binary alphabet. In this paper we give an improvement of the theorem of Levenshtein and Lothaire for a general alphabet and with lower and upper bounds for the number of occurrences of letters in the words
International audienceIn 1999 Lyngsø and Pedersen proposed a conjecture stating that every binary ci...
Twins in a finite word are formed by a pair of identical subwords placed at disjoint sets of positio...
Let l<sub>1</sub>, l<sub>2</sub>,...,)l<sub>n</sub> be a (possibly infinite) sequence of nonnegative...
peer reviewedA reconstruction problem of words from scattered factors asks for the minimal informati...
AMS Subject Classication: 68R15, 92D20 Abstract. Almost 30 years ago, M. Schützenberger and L. Simo...
The edit distance (a.k.a. the Levenshtein distance) between two words is defined as the minimum numb...
AbstractIt is shown that any word of lengthnis uniquely determined by all its[formula]subwords of le...
We examine finite words over an alphabet $Gamma={a,bar{a};b,bar{b}}$ of pairs of letters, where each...
AMS Subject Classication: 05D05, 68R15 Abstract. We examine nite words over an alphabet Γ = a; ā; b...
The problem of obtaining accurate estimates of the number of reconstructions for words over a binary...
Lutz Priese raised the following conjecture: Almost all words of length n over a finite alphabet A w...
Motivated by mass-spectrometry protein sequencing, we consider the problem of reconstructing a strin...
ABSTRACT: The problem considered is that of determining the number of subsequences obtain-able by de...
Article dans revue scientifique avec comité de lecture.A repetition in a word is a subword with the ...
AbstractPartial words are sequences over a finite alphabet that may contain wildcard symbols, called...
International audienceIn 1999 Lyngsø and Pedersen proposed a conjecture stating that every binary ci...
Twins in a finite word are formed by a pair of identical subwords placed at disjoint sets of positio...
Let l<sub>1</sub>, l<sub>2</sub>,...,)l<sub>n</sub> be a (possibly infinite) sequence of nonnegative...
peer reviewedA reconstruction problem of words from scattered factors asks for the minimal informati...
AMS Subject Classication: 68R15, 92D20 Abstract. Almost 30 years ago, M. Schützenberger and L. Simo...
The edit distance (a.k.a. the Levenshtein distance) between two words is defined as the minimum numb...
AbstractIt is shown that any word of lengthnis uniquely determined by all its[formula]subwords of le...
We examine finite words over an alphabet $Gamma={a,bar{a};b,bar{b}}$ of pairs of letters, where each...
AMS Subject Classication: 05D05, 68R15 Abstract. We examine nite words over an alphabet Γ = a; ā; b...
The problem of obtaining accurate estimates of the number of reconstructions for words over a binary...
Lutz Priese raised the following conjecture: Almost all words of length n over a finite alphabet A w...
Motivated by mass-spectrometry protein sequencing, we consider the problem of reconstructing a strin...
ABSTRACT: The problem considered is that of determining the number of subsequences obtain-able by de...
Article dans revue scientifique avec comité de lecture.A repetition in a word is a subword with the ...
AbstractPartial words are sequences over a finite alphabet that may contain wildcard symbols, called...
International audienceIn 1999 Lyngsø and Pedersen proposed a conjecture stating that every binary ci...
Twins in a finite word are formed by a pair of identical subwords placed at disjoint sets of positio...
Let l<sub>1</sub>, l<sub>2</sub>,...,)l<sub>n</sub> be a (possibly infinite) sequence of nonnegative...