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-ZMaRDI QIDQ466028zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. II: Reconstruction with forbidden words
• Reconstruction of cyclic words from their fragments
• Reconstructing words from subwords in linear time
• Word assembly through minimal forbidden words
• Forbidden Factors and Fragment Assembly

Cites work

• scientific article; zbMATH DE number 3811868 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 2183071 (Why is no real title available?)
• scientific article; zbMATH DE number 3311783 (Why is no real title available?)
• Algorithms on Strings, Trees and Sequences
• An Introduction to Symbolic Dynamics and Coding
• On a reconstruction problem for sequences
• Problems of information on the set of words
• Reconstruction of objects from a minimum number of distorted patterns
• Selection of informative feature values on the basis of solvability criteria in the problem of protein secondary structure recognition
• Unending chess, symbolic dynamics and a problem in semi-groups

Cited in

(9)

• Problems of information on the set of words
• Finite automata for testing composition-based reconstructibility of sequences
• Reconstructing Words from Right-Bounded-Block Words
• scientific article; zbMATH DE number 2087238 (Why is no real title available?)
• Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. II: Reconstruction with forbidden words
• Serial classification of fragments of words
• Reconstructing words from subwords in linear time
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466028)