On a reconstruction problem for sequences

DOI10.1006/JCTA.1997.2732MaRDI QIDQ1352885zbMATH OpenOpenAlexFDO

Authors Ilia Krasikov, Yehuda Roditty

Publication date 14 September 1997

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/8f98290fe80549588a55a6d927217f5b96717413

zbMATH Keywords

reconstruction of wordssystems of linear diophantine equations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other combinatorial number theory (11B75) Linear Diophantine equations (11D04) Diophantine equations in many variables (11D72) Combinatorics on words (68R15)

Recommendations

• Reconstruction of a word from a multiset of its factors
• Reconstructing words from subwords in linear time
• Reconstruction of sequences
• Reconstructing sequences
• Efficient reconstruction of sequences from their subsequences of supersequences

Cited in

(31)

• On highly palindromic words
• Combinatorial reconstruction problems
• Reconstructing subsets of \(\mathbb{Z}_n\)
• On a reconstruction problem
• Reconstruction from subsequences.
• Optimal mean-based algorithms for trace reconstruction
• Reconstructing words from subwords in linear time
• Reconstructing trees from traces
• On the word fragment length for unambiguous reconstruction of a periodic word from a complete multiset of fragments of fixed length
• Efficient Reconstruction of RC-Equivalent Strings
• Reconstruction of matrices from submatrices
• On Prouhet's solution to the equal powers problem
• A linear algorithm for string reconstruction in the reverse complement equivalence model
• Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words
• On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions
• Reconstructing words from right-bounded-block words
• Relations on words
• Trace reconstruction: generalized and parameterized
• Sequence Reconstruction for Limited-Magnitude Errors
• On the possibility of a periodic word reconstruction from the subwords of fixed length
• Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms
• Polynomials with multiple roots at 1
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Efficient reconstruction of sequences from their subsequences of supersequences
• On the number of distinct \(k\)-decks: enumeration and bounds
• Reconstructing Words from Right-Bounded-Block Words
• Reconstruction of hypermatrices from subhypermatrices
• A word reconstruction problem for polynomial regular languages
• Improvements on permutation reconstruction from minors
• Reconstructing under group actions.
• Reconstruction of a word from a multiset of its factors

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)