A new algorithm for generation of different types of RNA

DOI10.1080/00207160802140049zbMath1188.92011OpenAlexW2106077904MaRDI QIDQ3568449

No author found.

Publication date: 11 June 2010

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160802140049

zbMATH Keywords

rankingbiomathematicsunrankingRNA foldingtree generation

Mathematics Subject Classification ID

Trees (05C05) Nonnumerical algorithms (68W05) Biochemistry, molecular biology (92C40) Systems biology, networks (92C42)

Related Items (3)

Unnamed Item ⋮ Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order ⋮ Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order

Cites Work

• RNA secondary structures and their prediction
• Generating t-ary trees in A-order
• Lexicographic generation of ordered trees
• A note on generating binary trees inA-order andB-order
• Generating trees withnnodes andmleaves
• Efficient Generation of k-ary Trees in Natural Order
• A numbering system for binary trees
• Generation of Binary Trees from Ballot Sequences
• Generating t-Ary Trees Lexicographically
• Generating Regular k-ary Trees Efficiently
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new algorithm for generation of different types of RNA