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
    Kaohsiung
    期間09/12/709/12/9

      フィンガープリント

    ASJC Scopus subject areas

    • Computational Theory and Mathematics
    • Computer Networks and Communications
    • Software

    これを引用

    Kim, I., Watada, J., & Wu, J. Y. (2009). A DNA encoding method to determine and sequence all cliques in a weighted graph. : 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009 (pp. 1532-1537). [5412282] https://doi.org/10.1109/ICICIC.2009.10