Random $k$-noncrossing RNA Structures
Combinatorics
2015-05-13 v1 Probability
Abstract
In this paper we derive polynomial time algorithms that generate random -noncrossing matchings and -noncrossing RNA structures with uniform probability. Our approach employs the bijection between -noncrossing matchings and oscillating tableaux and the -recursiveness of the cardinalities of -noncrossing matchings. The main idea is to consider the tableaux sequences as paths of stochastic processes over shapes and to derive their transition probabilities.
Keywords
Cite
@article{arxiv.0906.5553,
title = {Random $k$-noncrossing RNA Structures},
author = {William Y. C. Chen and Hillary S. W. Han and Christian M. Reidys},
journal= {arXiv preprint arXiv:0906.5553},
year = {2015}
}
Comments
19 pages, 8 figures