Skip to main content
SpringerLink
Log in

Recognition of a sequence as a structure containing series of recurring vectors from an alphabet

  • Published:
Computational Mathematics and Mathematical Physics Aims and scope Submit manuscript

Abstract

A polynomial-time algorithm is designed for finding an optimal solution of a discrete optimization problem to which a pattern recognition problem is reduced, namely, the noise-proof recognition of a sequence as a structure consisting of contiguous subsequences in the form of series of identical nonzero vectors from an alphabet of vectors in the Euclidean space that alternate with zero vectors.

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. A. V. Kel’manov and S. A. Khamidullin, “Posterior detection of a given number of identical subsequences in a quasi-periodic sequence,” Comput. Math. Math. Phys. 41, 762–774 (2001).

    MathSciNet  MATH  Google Scholar 

  2. A. V. Kel’manov, S. A. Khamidullin, and L. V. Okol’nishnikova, “A posteriori detection of identical subsequence-fragments in a quasi-periodic sequence,” Sib. Zh. Ind. Mat. 5(2), 94–108 (2002).

    MathSciNet  MATH  Google Scholar 

  3. A. V. Kel’manov and S. A. Khamidullin, “Recognition of a quasi-periodic sequence formed from a given number of identical subsequences,” Sib. Zh. Ind. Mat. 2(1), 53–74 (1999).

    MathSciNet  MATH  Google Scholar 

  4. A. V. Kel’manov, S. A. Khamidullin, and L. V. Okol’nishnikova, “Recognition of a quasi-periodic sequence that includes identical subsequences-fragments,” Sib. Zh. Ind. Mat. 5(4), 38–54 (2002).

    MathSciNet  MATH  Google Scholar 

  5. A. V. Kel’manov and L. V. Mikhailova, “Joint detection of a given number of reference fragments in a quasiperiodic sequence and its partition into segments containing series of identical fragments,” Comput. Math. Math. Phys. 46, 165–181 (2006).

    Article  MathSciNet  Google Scholar 

  6. A. V. Kel’manov and L. V. Mikhailova, “A posteriori joint detection of reference fragments in a quasi-periodic sequence,” Comput. Math. Math. Phys. 48, 850–865 (2008).

    Article  MathSciNet  Google Scholar 

  7. A. V. Kel’manov and L. V. Mikhailova, “Recognition of a numerical sequence that includes series of quasi-periodic recurring standard fragments: The case of a known number of fragments,” Sib. Zh. Ind. Mat. 8(3), 69–86 (2005).

    MathSciNet  MATH  Google Scholar 

  8. A. V. Kel’manov and L. V. Mikhailova, “Recognition of a numerical sequence that includes series of quasi-periodically recurring standard fragments,” Sib. Zh. Ind. Mat. 10(4), 61–75 (2007).

    MathSciNet  MATH  Google Scholar 

  9. A. V. Kel’manov and S. A. Khamidullin, “A posteriori joint detection and distinction of a given number of subsequences in a quasi-periodic sequence,” Sib. Zh. Ind. Mat. 2(2), 106–119 (1999).

    MathSciNet  Google Scholar 

  10. A. V. Kel’manov and L. V. Okol’nishnikova, “A posteriori joint detection and distinguishing of subsequences in a quasi-periodic sequence,” Sib. Zh. Ind. Mat. 3(2), 115–139 (2000).

    MathSciNet  MATH  Google Scholar 

  11. http://math.nsc.ru/~serge/qpsl/.

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, pr. Akademika Koptyuga 4, Novosibirsk, 630090, Russia

    A. V. Kel’manov & L. V. Mikhailova

Authors
  1. A. V. Kel’manov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. V. Mikhailova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Kel’manov.

Additional information

Original Russian Text © A.V. Kel’manov, L.V. Mikhailova, 2013, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2013, Vol. 53, No. 7, pp. 1212–1224.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kel’manov, A.V., Mikhailova, L.V. Recognition of a sequence as a structure containing series of recurring vectors from an alphabet. Comput. Math. and Math. Phys. 53, 1044–1055 (2013). https://doi.org/10.1134/S0965542513070154

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0965542513070154

Keywords

Search

Navigation