Skip Navigation

This Article
Right arrow Print PDF (483K)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Comay, E.
Right arrow Articles by Comay, O.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Comay, E.
Right arrow Articles by Comay, O.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 1984, Vol. 12, No. 1Part1 53-66
© 1984

MAIN-FRAME COMPUTERS

An accelerated algorithm for calculating the secondary structure of single stranded RNAs

Eliahu Comay1, Ruth Nussinov2,* and Oded Comay3

1Physics Department, School of Mathematics 2Computer Science Department, School of Mathematics 3Computer Center, Tel Aviv University Ramat Aviv, Tel Aviv, Israel

*To whom all correspondence should be addressed

Received July 29, 1983. We describe a code designed for secondary structure computation of single stranded RNA molecules. While it incorporates the same principles as the original algorithm of Nussinov et al (1978), its restructuring improves the logic and the approach of the codes based on it. For long sequences the code is at least an order of magnitude faster. For a chain n nucleotides long, references to computer disk memory are reduced from n3 to less than n2. For n»100, disk references behave like n3/6000.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.