RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2013 Volume 49, Issue 1, Pages 61–65 (Mi ppi2102)

This article is cited in 3 papers

Large Systems

Non-crossing matchings

A. A. Vladimirovab

a Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow
b National Research University "Higher School of Economics", Moscow

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.

UDC: 621.391.1+519.7

Received: 01.11.2012
Revised: 21.11.2012


 English version:
Problems of Information Transmission, 2013, 49:1, 54–57

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025