Brief Papers: Parallel Algorithms for Finding a Near-Maximum Independent Set of a Circle Graph

Yoshiyasu Takefuji, Li Lin Chen, Kuo Chun Lee, John Huffman

研究成果: Article査読

39 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)263-267
ページ数5
ジャーナルIEEE Transactions on Neural Networks
1
3
DOI
出版ステータスPublished - 1990 9月
外部発表はい

ASJC Scopus subject areas

  • ソフトウェア
  • コンピュータ サイエンスの応用
  • コンピュータ ネットワークおよび通信
  • 人工知能

フィンガープリント

「Brief Papers: Parallel Algorithms for Finding a Near-Maximum Independent Set of a Circle Graph」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル