A DNA encoding method to determine and sequence all cliques in a weighted graph

Ikno Kim, Junzo Watada, Jui Yu Wu

    研究成果: Conference contribution

    1 被引用数 (Scopus)

    抄録

    In many aspects of advanced applied information technology, science, and bioinformatics, having theoretical concepts based on graph theory provides an important way to create or develop new hybrids, combined information, and intelligent techniques or methods. Finding the maximum weighted clique problem can be a significant issue and concept in graph theory. Meanwhile, encoding biological codes, represented as biological sequence information, is an important process in executing biological computations. In this paper, we focus on a way of encoding biological sequences to create a new encoding method particularly designed to solve clique problems in a weighted graph.

    本文言語English
    ホスト出版物のタイトル2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009
    ページ1532-1537
    ページ数6
    DOI
    出版ステータスPublished - 2009
    イベント2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009 - Kaohsiung
    継続期間: 2009 12 72009 12 9

    Other

    Other2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009
    CityKaohsiung
    Period09/12/709/12/9

    ASJC Scopus subject areas

    • 計算理論と計算数学
    • コンピュータ ネットワークおよび通信
    • ソフトウェア

    フィンガープリント

    「A DNA encoding method to determine and sequence all cliques in a weighted graph」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

    引用スタイル