|
Problemy Peredachi Informatsii, 2013, Volume 49, Issue 1, Pages 61–65
(Mi ppi2102)
|
|
|
|
This article is cited in 3 scientific papers (total 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.
Received: 01.11.2012 Revised: 21.11.2012
Citation:
A. A. Vladimirov, “Non-crossing matchings”, Probl. Peredachi Inf., 49:1 (2013), 61–65; Problems Inform. Transmission, 49:1 (2013), 54–57
Linking options:
https://www.mathnet.ru/eng/ppi2102 https://www.mathnet.ru/eng/ppi/v49/i1/p61
|
Statistics & downloads: |
Abstract page: | 350 | Full-text PDF : | 67 | References: | 56 | First page: | 16 |
|