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

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

Research output: Contribution to journalArticle

34 Citations (Scopus)

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 languageEnglish
Pages (from-to)263-267
Number of pages5
JournalIEEE Transactions on Neural Networks
Volume1
Issue number3
DOIs
Publication statusPublished - 1990 Sep
Externally publishedYes

Fingerprint

RNA
Parallel algorithms
Simulators
Neural networks

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

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

In: IEEE Transactions on Neural Networks, Vol. 1, No. 3, 09.1990, p. 263-267.

Research output: Contribution to journalArticle

Takefuji, Yoshiyasu ; Chen, Li Lin ; Lee, Kuo Chun ; Huffman, John. / Parallel algorithms for finding a near-maximum independent set of a circle graph. In: IEEE Transactions on Neural Networks. 1990 ; Vol. 1, No. 3. pp. 263-267.
@article{9e11efb8d3574a8e8c08f2bcddb50cbe,
title = "Parallel algorithms for finding a near-maximum independent set of a circle graph",
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.",
author = "Yoshiyasu Takefuji and Chen, {Li Lin} and Lee, {Kuo Chun} and John Huffman",
year = "1990",
month = "9",
doi = "10.1109/72.80251",
language = "English",
volume = "1",
pages = "263--267",
journal = "IEEE Transactions on Neural Networks and Learning Systems",
issn = "2162-237X",
publisher = "IEEE Computational Intelligence Society",
number = "3",

}

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

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 -