Reconstructing words using queries on subwords or factors - Archive ouverte HAL
Communication Dans Un Congrès Année : 2023

Reconstructing words using queries on subwords or factors

Résumé

We study word reconstruction problems. Improving a previous result by P. Fleischmann, M. Lejeune, F. Manea, D. Nowotka and M. Rigo, we prove that, for any unknown word w of length n over an alphabet of cardinality k, w can be reconstructed from the number of occurrences as subwords (or scattered factors) of O(k 2 n log 2 (n)) words. Two previous upper bounds obtained by S. S. Skiena and G. Sundaram are also slightly improved: one when considering information on the existence of subwords instead of on the numbers of their occurrences, and, the other when considering information on the existence of factors.
Fichier principal
Vignette du fichier
2301.01571.pdf (203.63 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03922190 , version 1 (04-01-2023)
hal-03922190 , version 2 (05-02-2023)

Identifiants

Citer

Gwenaël Richomme, Matthieu Rosenfeld. Reconstructing words using queries on subwords or factors. STACS 2023 - 40th International Symposium on Theoretical Aspects of Computer Science, Mar 2023, Hambourg, Germany. pp.52:1-52:15, ⟨10.4230/LIPIcs.STACS.2023.52⟩. ⟨hal-03922190v2⟩
65 Consultations
51 Téléchargements

Altmetric

Partager

More