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-ZzbMATH Open1298.68208OpenAlexW12090595MaRDI QIDQ466028FDOQ466028

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

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

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)

Cites Work

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

Cited In (8)

• Finite automata for testing composition-based reconstructibility of sequences
• Reconstructing Words from Right-Bounded-Block Words
• Title not available (Why is that?)
• 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
• 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

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