On the word fragment length for unambiguous reconstruction of a periodic word from a complete multiset of fragments of fixed length

DOI10.1134/S106456242202003XOpenAlexW4286652284MaRDI QIDQ2155320

Yanyan Li

Publication date: 15 July 2022

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

Full work available at URL: https://doi.org/10.1134/s106456242202003x

zbMATH Keywords

periodic wordsubwordwordfragmentmultiset of subwordsreconstruction from incomplete informationword reconstruction

Mathematics Subject Classification ID

Sequences and sets (11Bxx) Discrete mathematics in relation to computer science (68Rxx) Enumerative combinatorics (05Axx)

Cites Work

• Reconstruction of sequences
• On a reconstruction problem for sequences
• Reconstructing sequences
• Reconstruction from subsequences.
• Algorithms on Strings, Trees and Sequences
• Littlewood-Type Problems on [0,1]
• Efficient reconstruction of sequences from their subsequences of supersequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the word fragment length for unambiguous reconstruction of a periodic word from a complete multiset of fragments of fixed length