On a reconstruction problem for sequences
From MaRDI portal
Recommendations
Cited in
(28)- Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words
- Processes, Terms and Cycles: Steps on the Road to Infinity
- On the word fragment length for unambiguous reconstruction of a periodic word from a complete multiset of fragments of fixed length
- Reconstruction of a word from a multiset of its factors
- On the number of distinct \(k\)-decks: enumeration and bounds
- On a reconstruction problem
- Reconstructing words from subwords in linear time
- Reconstruction from subsequences.
- Combinatorial reconstruction problems
- Efficient Reconstruction of RC-Equivalent Strings
- Reconstructing under group actions.
- Reconstructing words from right-bounded-block words
- On Prouhet's solution to the equal powers problem
- Reconstructing subsets of \(\mathbb{Z}_n\)
- Reconstructing trees from traces
- scientific article; zbMATH DE number 7525505 (Why is no real title available?)
- Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms
- Sequence Reconstruction for Limited-Magnitude Errors
- Efficient reconstruction of sequences from their subsequences of supersequences
- Relations on words
- Reconstructing Words from Right-Bounded-Block Words
- A linear algorithm for string reconstruction in the reverse complement equivalence model
- On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions
- Polynomials with multiple roots at 1
- Reconstruction of hypermatrices from subhypermatrices
- Reconstruction of matrices from submatrices
- Optimal mean-based algorithms for trace reconstruction
- On highly palindromic words
This page was built for publication: On a reconstruction problem for sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1352885)
