Reconstructing sequences
We prove that every sequence of length n can be reconstructed from the multiset of all its subsequences of length k, provided k ⩾ (1 + o(1))√n log n. This is a substantial improvement on previous bounds.
Saved in:
| Published in | Discrete mathematics Vol. 175; no. 1-3; pp. 231 - 238 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
15.10.1997
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | We prove that every sequence of length n can be reconstructed from the multiset of all its subsequences of length k, provided k ⩾ (1 + o(1))√n log n. This is a substantial improvement on previous bounds. |
|---|---|
| ISSN: | 0012-365X 1872-681X |
| DOI: | 10.1016/S0012-365X(96)00153-7 |