Reconstructing words using queries on subwords or factors
| Autor: | Richomme, Gwenaël, Rosenfeld, Matthieu |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2023 |
| Předmět: |
FOS: Computer and information sciences
Word reconstruction Discrete Mathematics (cs.DM) Subwords Theory of computation → Design and analysis of algorithms Mathematics of computing → Combinatorics on words FOS: Mathematics Mathematics - Combinatorics Combinatorics (math.CO) Factors Computer Science - Discrete Mathematics |
| Popis: | 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²√{nlog₂(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. LIPIcs, Vol. 254, 40th International Symposium on Theoretical Aspects of Computer Science (STACS 2023), pages 52:1-52:15 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|