### Abstract

A parallel algorithm for estimating the secondary structure of an RNA molecule is presented in this paper. The mathematical problem to compute an optimal folding based on free-energy minimization is mapped onto a graph planarization problem. In the planarization problem we want to maximize the number of edges in a plane with no two edges crossing each other. To solve a sequence of n bases, n(n - 1)/2 processing elements are used in our algorithm.

Original language | English |
---|---|

Pages (from-to) | 337-340 |

Number of pages | 4 |

Journal | Biological Cybernetics |

Volume | 63 |

Issue number | 5 |

DOIs | |

Publication status | Published - 1990 Sep |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Biophysics

### Cite this

*Biological Cybernetics*,

*63*(5), 337-340. https://doi.org/10.1007/BF00202750

**A parallel algorithm for estimating the secondary structure in ribonucleic acids.** / Takefuji, Yoshiyasu; Lin, C. W.; Lee, K. C.

Research output: Contribution to journal › Article

*Biological Cybernetics*, vol. 63, no. 5, pp. 337-340. https://doi.org/10.1007/BF00202750

}

TY - JOUR

T1 - A parallel algorithm for estimating the secondary structure in ribonucleic acids

AU - Takefuji, Yoshiyasu

AU - Lin, C. W.

AU - Lee, K. C.

PY - 1990/9

Y1 - 1990/9

N2 - A parallel algorithm for estimating the secondary structure of an RNA molecule is presented in this paper. The mathematical problem to compute an optimal folding based on free-energy minimization is mapped onto a graph planarization problem. In the planarization problem we want to maximize the number of edges in a plane with no two edges crossing each other. To solve a sequence of n bases, n(n - 1)/2 processing elements are used in our algorithm.

AB - A parallel algorithm for estimating the secondary structure of an RNA molecule is presented in this paper. The mathematical problem to compute an optimal folding based on free-energy minimization is mapped onto a graph planarization problem. In the planarization problem we want to maximize the number of edges in a plane with no two edges crossing each other. To solve a sequence of n bases, n(n - 1)/2 processing elements are used in our algorithm.

UR - http://www.scopus.com/inward/record.url?scp=0025164149&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025164149&partnerID=8YFLogxK

U2 - 10.1007/BF00202750

DO - 10.1007/BF00202750

M3 - Article

VL - 63

SP - 337

EP - 340

JO - Biological Cybernetics

JF - Biological Cybernetics

SN - 0340-1200

IS - 5

ER -