Probabilistic Analysis

Christian Reidys ()
Additional contact information
Christian Reidys: Nankai University, Research Center for Combinatorics

Chapter 5 in Combinatorial Computational Biology of RNA, 2011, pp 143-186 from Springer

Abstract: Abstract In this section we prove that k-noncrossing RNA structures can be generated efficiently with uniform probability. The results presented here are derived from [26] and are based on Section 2.1.

Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-387-76731-4_5

Ordering information: This item can be ordered from
http://www.springer.com/9780387767314

DOI: 10.1007/978-0-387-76731-4_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().