### Abstract

A parallel algorithm for finding a near-maximum independent set in a circle graph is presented. An independent set in a graph is a set of vertices, no two of which are adjacent. A maximum independent set is an independent set whose cardinality is the largest among all independent sets of a graph. The algorithm is modified for predicting the secondary structure in ribonucleic acids (RNA). The proposed system, composed of an n neural network array (where n is the number of edges in the circle graph or the number of possible base pairs) not only generates a near-maximum independent set but also predicts the secondary structure of ribonucleic acids within several hundred iteration steps. Our simulator discovered several solutions which are more stable structures, in a sequence of 359 bases from the potato spindle tuber viroid (PSTV), than the formerly proposed structures. The simulator was tested in solving other problems.

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

Pages (from-to) | 263-267 |

Number of pages | 5 |

Journal | IEEE Transactions on Neural Networks |

Volume | 1 |

Issue number | 3 |

DOIs | |

Publication status | Published - 1990 Sep |

Externally published | Yes |

### ASJC Scopus subject areas

- Software
- Computer Science Applications
- Computer Networks and Communications
- Artificial Intelligence

## Fingerprint Dive into the research topics of 'Brief Papers: Parallel Algorithms for Finding a Near-Maximum Independent Set of a Circle Graph'. Together they form a unique fingerprint.

## Cite this

*IEEE Transactions on Neural Networks*,

*1*(3), 263-267. https://doi.org/10.1109/72.80251