Skip to main content
SpringerLink
Log in

Reconstruction of a Word from a Finite Set of its Subwords Under the Unit Shift Hypothesis. II. Reconstruction with Forbidden Words

  • NEW MEANS OF CYBERNETICS, INFORMATICS, COMPUTER ENGINEERING, AND SYSTEMS ANALYSIS
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

An extension of the problem of reconstruction of words from a given multiset of its subwords supposedly generated by unit shifts of a window of fixed length along such words. In the extension, feasible solutions must satisfy additional constraints. The case is considered when these constraints are specified by forbidden words. A solution to the problem is obtained as a result of searching for Euler paths or Euler cycles in a de Bruijn multidigraph with the additional operation of reduction of its edges and subsequent application of special algebraic operations of multiplication of adjacency matrices as in the first part of this article.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Yu. G. Smetanin, M. V. Ulyanov, “Reconstruction of a word from a finite set of its subwords under the unit shift hypothesis. I. Reconstruction without forbidden words,” Cybernetics and Systems Analysis, 50, No. 1, 168–177 (2014).

    Article  MathSciNet  Google Scholar 

  2. A. Carpi and A. de Luca, “Words and special factors,” Theoretical Computer Sci., 259, 145–182 (2001).

    Article  MATH  Google Scholar 

  3. D. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding, Cambridge Univ. Press, Cambridge, UK (1995).

    Book  MATH  Google Scholar 

  4. N. G. de Bruijn, “A combinatorial problem,” Nederl. Akad. Wetensch. Proc. 49, 758–764 (1946); Indagoniones Math, 8, 461–467 (1946).

  5. S. D. Shaporev, A Course in Discrete Mathematics [in Russian], BHV–Peterburg, St. Petersburg (2006).

    Google Scholar 

  6. M. Lothaire, Combinatorics of Words, Encyclopedia of Mathematics and Its Applications, 17, Addison-Wesley, Reading, Mass. (1983), http://www-igm.univ-mlv.fr/~berstel/Lothaire/.

  7. M. Lothaire, Algebraic Combinatorics on Words, Cambridge Univ. Press, Cambridge, UK (2002), http://www-igm.univ-mlv.fr/~berstel/Lothaire/.

  8. M. Lothaire, Applied Combinatorics on Words (2005).

  9. W. Dreyer, Dittrich A. Kotz, and D. Schmidt, “Research perspectives for time series management systems,” SIGMOD Record, 23, No. 1, 10–15 (1994).

    Article  Google Scholar 

  10. D. Gusfield, Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology [Russian translation], Nevsky Dialekt-BHV–Peterburg, St. Petersburg (2003).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dorodnicyn Computing Centre of RAS and Moscow Institute of Physics and Technology, Moscow, Russia

    Yu. G. Smetanin

  2. National Research University “Higher School of Economics” of the Moscow State University of Printing Arts, Moscow, Russia

    M. V. Ulyanov

Authors
  1. Yu. G. Smetanin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. V. Ulyanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Yu. G. Smetanin or M. V. Ulyanov.

Additional information

This work was supported by the Russian Foundation for Basic Research under grant No. 13-07-00516. Continued from No. 1, 2014.

Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 179–186, January–February, 2015.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Smetanin, Y.G., Ulyanov, M.V. Reconstruction of a Word from a Finite Set of its Subwords Under the Unit Shift Hypothesis. II. Reconstruction with Forbidden Words. Cybern Syst Anal 51, 157–164 (2015). https://doi.org/10.1007/s10559-015-9708-y

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-015-9708-y

Keywords

Search

Navigation