Reconstruction of sequences
From MaRDI portal
Publication:1182969
DOI10.1016/0012-365X(91)90026-XzbMath0746.05045OpenAlexW2014342457MaRDI QIDQ1182969
Publication date: 28 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(91)90026-x
Other combinatorial number theory (11B75) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (18)
Reconstructing Words from Right-Bounded-Block Words ⋮ On the word fragment length for unambiguous reconstruction of a periodic word from a complete multiset of fragments of fixed length ⋮ Order of weak \(M\)-relation and Parikh matrices ⋮ Reconstructing sequences ⋮ On the number of distinct \(k\)-decks: enumeration and bounds ⋮ Reconstruction from subsequences. ⋮ Counting subwords in circular words and their Parikh matrices ⋮ Characterizations of families of morphisms and words via binomial complexities ⋮ Reconstruction of a word from a multiset of its factors ⋮ Optimal mean-based algorithms for trace reconstruction ⋮ Freeness Problem for Matrix Semigroups of Parikh Matrices ⋮ Efficient reconstruction of sequences from their subsequences of supersequences ⋮ Independence of certain quantities indicating subword occurrences ⋮ Unnamed Item ⋮ Separability of M-Equivalent Words by Morphisms ⋮ Computing the \(k\)-binomial complexity of the Thue-Morse word ⋮ On highly palindromic words ⋮ Reconstructing Words from Right-Bounded-Block Words
Cites Work
This page was built for publication: Reconstruction of sequences
