Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Non-crossing matchings

Non-crossing matchings 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

Non-crossing matchings

Vladimirov, A.
Problems of Information Transmission , Volume 49 (1) – Apr 13, 2013
Download PDF
4 pages

Loading next page...
 
/lp/springer_journal/non-crossing-matchings-kACYq05dfY

References (1)

Publisher
Springer Journals
Copyright
Copyright © 2013 by Pleiades Publishing, Ltd.
Subject
Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
ISSN
0032-9460
eISSN
1608-3253
DOI
10.1134/S0032946013010055
Publisher site
See Article on Publisher Site

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.

Journal

Problems of Information Transmission – Springer Journals

Published: Apr 13, 2013

There are no references for this article.