✦ LIBER ✦

Asymptotic Enumeration of RNA Structures with

✍ Scribed by Emma Y. Jin; Christian M. Reidys

Publisher: Springer
Year: 2008
Tongue: English
Weight: 807 KB
Volume: 70
Category: Article
ISSN: 1522-9602
DOI: 10.1007/s11538-007-9265-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Asymptotic enumeration of cographs

✍ Vlady Ravelomanana; Loÿs Thimonier 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 283 KB

Asymptotic Enumeration of Convex Polygon

Asymptotic Enumeration of Convex Polygons

✍ Dudley Stark; Nicholas C. Wormald 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 413 KB

A polygon is an elementary (self-avoiding) cycle in the hypercubic lattice Z d taking at least one step in every dimension. A polygon on Z d is said to be convex if its length is exactly twice the sum of the side lengths of the smallest hypercube containing it. The number of d-dimensional convex pol

Asymptotic enumeration of full graphs

✍ D. J. Kleitman; F. R. Lasaga; L. J. Cowen 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 539 KB

## Abstract A __full graph__ on __n__ vertices, as defined by Fulkerson, is a representation of the intersection and containment relations among a system of __n__ sets. It has an undirected edge between vertices representing intersecting sets, and a directed edge from __a__ to __b__ if the correspo

Asymptotic Enumeration of Tournaments wi

Asymptotic Enumeration of Tournaments with a Given Score Sequence

✍ Brendan D. McKay; Xiaoji Wang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 560 KB

We obtain the asymptotic number of labeled trounaments with a given score sequence in the case where each score is nÂ2+O(n 3Â4+= ) for sufficiently small =>0. Some consequences for the score sequences of random tournaments are also noted. The method used is integration in n complex dimensions.

Asymptotic enumeration of generalized la

Asymptotic enumeration of generalized latin rectangles

✍ Timothy A Green 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Asymptotic enumeration of two-dimensiona

Asymptotic enumeration of two-dimensional posets

✍ M. El-Zahar; N. W. Sauer 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 271 KB

In this paper we show that the number of pairwise nonisomorphic two-dimensional posets with n elements is asymptotically equivalent to =l n!. This estimate is based on a characterization, in terms of structural decomposmon, of two-d~mensmnal posets having a umque rep~\*sentation as the intersection