### 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 of 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. The simulator discovered several solutions which are more stable structures, in a sequence of 359 bases from the potato spindle tuber viroid, than previously proposed structures.

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 |

### Fingerprint

### ASJC Scopus subject areas

- Artificial Intelligence

### Cite this

*IEEE Transactions on Neural Networks*,

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

**Parallel algorithms for finding a near-maximum independent set of a circle graph.** / Takefuji, Yoshiyasu; Chen, Li Lin; Lee, Kuo Chun; Huffman, John.

Research output: Contribution to journal › Article

*IEEE Transactions on Neural Networks*, vol. 1, no. 3, pp. 263-267. https://doi.org/10.1109/72.80251

}

TY - JOUR

T1 - Parallel algorithms for finding a near-maximum independent set of a circle graph

AU - Takefuji, Yoshiyasu

AU - Chen, Li Lin

AU - Lee, Kuo Chun

AU - Huffman, John

PY - 1990/9

Y1 - 1990/9

N2 - 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 of 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. The simulator discovered several solutions which are more stable structures, in a sequence of 359 bases from the potato spindle tuber viroid, than previously proposed structures.

AB - 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 of 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. The simulator discovered several solutions which are more stable structures, in a sequence of 359 bases from the potato spindle tuber viroid, than previously proposed structures.

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

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

U2 - 10.1109/72.80251

DO - 10.1109/72.80251

M3 - Article

AN - SCOPUS:0025483481

VL - 1

SP - 263

EP - 267

JO - IEEE Transactions on Neural Networks and Learning Systems

JF - IEEE Transactions on Neural Networks and Learning Systems

SN - 2162-237X

IS - 3

ER -