Skip to main content
Log in

Non-crossing matchings

  • Large Systems
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We model the secondary structure of an RNA molecule by means of a maximal non-crossing matching on a random word in a finite alphabet, where ties are only allowed between certain pairs of letters. We prove that the mean fraction of unmatched symbols does not vanish as the length of the word tends to infinity.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Valba, O.V., Tamm, M.V., and Nechaev, S.K., New Alphabet-Dependent Morphological Transition in Random RNA Alignment, Phys. Rev. Lett., 2012, vol. 109, no. 1, pp. 018102.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. A. Vladimirov.

Additional information

Original Russian Text © A.A. Vladimirov, 2013, published in Problemy Peredachi Informatsii, 2013, Vol. 49, No. 1, pp. 61–65.

Supported in part by the Russian Foundation for Basic Research, project no. 10-01-93114.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vladimirov, A.A. Non-crossing matchings. Probl Inf Transm 49, 54–57 (2013). https://doi.org/10.1134/S0032946013010055

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Navigation