Jan 4, 2023 · 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.

▶ Theorem 1. The number of #-subword queries needed to reconstruct a word of length n over {0, 1} is at most 7 √n log n + 4 whether n is known or not.

Abstract. We study word reconstruction problems. Improving a previous result by P. Fleischmann, M. Lejeune, F. Manea, D. Nowotka and M. Rigo, we prove that, ...

Mar 3, 2023 · DROPS enables publication of the latest research findings in a fast, uncomplicated manner, in addition to providing unimpeded, open access to ...

It is proved 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 ...

I will present some results that we recently obtained about word reconstruction problems. In this setting you can ask queries from a fixed family of queries ...

Dec 6, 2023 · Matthieu Rosenfeld, Word reconstruction using queries on subwords or factors · Comments.

We study word reconstruction problems. Improving a previous result by P. Fleischmann, M. Lejeune, F. Manea, D. Nowotka and M. Rigo, we prove that, ...

Connected Papers is a visual tool to help researchers and applied scientists find academic papers relevant to their field of work.

Reconstructing Words Using Queries on Subwords or Factors. pdf-format: LIPIcs-STACS-2023-52.pdf (0.7 MB). Abstract. We study word reconstruction problems.