Reconstruction of a word from a multiset of its factors

Authors:
Claribet Piña;Carlos Uzcátegui
Affiliations:
Departamento de Matemáticas, Facultad de Ciencias, Universidad de Los Andes, Mérida, 5101, Venezuela;Departamento de Matemáticas, Facultad de Ciencias, Universidad de Los Andes, Mérida, 5101, Venezuela
Venue:
Theoretical Computer Science
Year:
2008

Citing 5
Cited 3

Reconstruction of sequences

Discrete Mathematics
Efficient reconstruction of sequences from their subsequences or supersequences

Journal of Combinatorial Theory Series A
Words and special factors

Theoretical Computer Science
Words and forbidden factors

Theoretical Computer Science
Word assembly through minimal forbidden words

Theoretical Computer Science

Efficient reconstruction of RC-equivalent strings

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
A linear algorithm for string reconstruction in the reverse complement equivalence model

Journal of Discrete Algorithms
On multiset of factors of a word

Information Processing Letters

Quantified Score

Hi-index	5.23

Visualization

Abstract

Let D"k(w) be the multiset containing all factors of w of length k including repetitions. One of the main results is that if D"k(w)=D"k(v) for all k@?@?|w|2@?+1, then w=v. The bound @?|w|2@?+1 is optimal; however we will also show that if D"k(w)=D"k(v) for all k@?@?|w|2@?, then w and v are structurally similar.