Reconstruction from subsequences

Authors:
Miroslav Dudík;Leonard J. Schulman
Affiliations:
Princeton University, Princeton, NJ;California Institute of Technology, Pasadena, CA
Venue:
Journal of Combinatorial Theory Series A
Year:
2003

Citing 3
Cited 12

Reconstruction of sequences

Discrete Mathematics
On a reconstruction problem for sequences

Journal of Combinatorial Theory Series A
Combinatorics of words

Handbook of formal languages, vol. 1

Connections between subwords and certain matrix mappings

Theoretical Computer Science - The art of theory
Independence of certain quantities indicating subword occurrences

Theoretical Computer Science
Subword conditions and subword histories

Information and Computation
On Some Problems of Mateescu Concerning Subword Occurrences

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Subword Balance in BinaryWords, Languages and Sequences

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
On highly palindromic words

Discrete Applied Mathematics
Efficient reconstruction of RC-equivalent strings

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
The spectra of words

Processes, Terms and Cycles
A linear algorithm for string reconstruction in the reverse complement equivalence model

Journal of Discrete Algorithms
Subword Balance in BinaryWords, Languages and Sequences

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
On Some Problems of Mateescu Concerning Subword Occurrences

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
A regularity lemma and twins in words

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of reconstructing an n-sequence, given the multiplicities with which k-sequences occur as subsequences. We improve the lower bound on k from Ω(log n) to exp(Ω(log½ n)).