Basic concepts

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

Chapter 2 in Combinatorial Computational Biology of RNA, 2011, pp 23-65 from Springer

Abstract: Abstract In this chapter we provide the mathematical foundation for the following results. One main objective here is the self-contained derivation of the generating function of k-noncrossing matchings, which will play a central role for RNA pseudoknot structures.

Keywords: Cayley Graph; Vertex Boundary; Weyl Chamber; Combinatorial Class; Reflection Principle (search for similar items in EconPapers)
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_2

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

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

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 ().