Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words

DOI10.1007/S10559-014-9602-ZzbMath1298.68208OpenAlexW12090595MaRDI QIDQ466028

M. V. Ulyanov, Yu. G. Smetanin

Publication date: 24 October 2014

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-014-9602-z

zbMATH Keywords

de Bruijn graphenumeration of pathsEuler pathreconstruction of words graphreconstruction without forbidden wordssymbolic matrix multiplication

Mathematics Subject Classification ID

Combinatorics on words (68R15) Enumeration in graph theory (05C30) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Algorithms on strings (68W32)

Related Items (1)

Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. II: Reconstruction with forbidden words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Selection of informative feature values on the basis of solvability criteria in the problem of protein secondary structure recognition
• On a reconstruction problem for sequences
• Reconstruction of objects from a minimum number of distorted patterns
• Unending chess, symbolic dynamics and a problem in semi-groups
• Algorithms on Strings, Trees and Sequences
• An Introduction to Symbolic Dynamics and Coding
• Problems of information on the set of words

This page was built for publication: Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words