Reconstructing sequences

DOI10.1016/S0012-365X(96)00153-7zbMath0890.05003OpenAlexW2912739023MaRDI QIDQ1377760

Alexander D. Scott

Publication date: 29 June 1998

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00153-7

zbMATH Keywords

reconstructionbinary sequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other combinatorial number theory (11B75)

Related Items (7)

Reconstructing under group actions. ⋮ On the word fragment length for unambiguous reconstruction of a periodic word from a complete multiset of fragments of fixed length ⋮ On the number of distinct \(k\)-decks: enumeration and bounds ⋮ Serial classification of fragments of words ⋮ Optimal mean-based algorithms for trace reconstruction ⋮ Spectral concepts in genome informational analysis ⋮ Reconstructing subsets of \(\mathbb{Z}_n\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstruction of sequences
• On a non-classical recognition problem
• On Reconstruction of Matrices

This page was built for publication: Reconstructing sequences