论文信息 - Linear trees and RNA secondary . structuret ' S

Linear trees and RNA secondary . structuret ' S

The total number of RNA secondary structures of a given length with a fixed number of base pairs is computed, under the assumption that all base pairs can occur. This is done by establishing a one-to-one correspondence between secondary structures and trees. A duality operator on trees is presented, which explains a symmetry in the numbers counting secondary structures.

William R. Schmitt | Michael | Watermanb

[1] A. Read. Genes IV , 1990 .

[2] Temple F. Smith,et al. Rapid dynamic programming algorithms for RNA secondary structure , 1986 .

[3] W Y Chen,et al. A general bijective algorithm for trees. , 1990, Proceedings of the National Academy of Sciences of the United States of America.

[4] M. Waterman. Secondary Structure of Single-Stranded Nucleic Acidst , 1978 .

[5] Michael S. Waterman,et al. Combinatorics of RNA Hairpins and Cloverleaves , 1979 .

[6] Paul R. Stein,et al. On a Class of Linked Diagrams, I. Enumeration , 1978, J. Comb. Theory A.

[7] Michael S. Waterman,et al. On some new sequences generalizing the Catalan and Motzkin numbers , 1979, Discret. Math..

[8] Michael S. Waterman,et al. COMPUTATION OF GENERATING FUNCTIONS FOR BIOLOGICAL MOLECULES , 1980 .