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

Ikno Kim, Junzo Watada, Jui Yu Wu

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)

    Abstract

    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.

    Original languageEnglish
    Title of host publication2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009
    Pages1532-1537
    Number of pages6
    DOIs
    Publication statusPublished - 2009
    Event2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009 - Kaohsiung
    Duration: 2009 Dec 72009 Dec 9

    Other

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

    Fingerprint

    Graph theory
    DNA
    Bioinformatics
    Information technology

    Keywords

    • Bio-inspired computation
    • DNA encoding method
    • Weighted clique
    • Weighted graph

    ASJC Scopus subject areas

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

    Cite this

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

    A DNA encoding method to determine and sequence all cliques in a weighted graph. / Kim, Ikno; Watada, Junzo; Wu, Jui Yu.

    2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009. 2009. p. 1532-1537 5412282.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Kim, I, Watada, J & Wu, JY 2009, A DNA encoding method to determine and sequence all cliques in a weighted graph. in 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009., 5412282, pp. 1532-1537, 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009, Kaohsiung, 09/12/7. https://doi.org/10.1109/ICICIC.2009.10
    Kim I, Watada J, Wu JY. A DNA encoding method to determine and sequence all cliques in a weighted graph. In 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009. 2009. p. 1532-1537. 5412282 https://doi.org/10.1109/ICICIC.2009.10
    Kim, Ikno ; Watada, Junzo ; Wu, Jui Yu. / 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. 2009. pp. 1532-1537
    @inproceedings{8ddbe67419e44c9fb299a79fe11cdab1,
    title = "A DNA encoding method to determine and sequence all cliques in a weighted graph",
    abstract = "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.",
    keywords = "Bio-inspired computation, DNA encoding method, Weighted clique, Weighted graph",
    author = "Ikno Kim and Junzo Watada and Wu, {Jui Yu}",
    year = "2009",
    doi = "10.1109/ICICIC.2009.10",
    language = "English",
    isbn = "9780769538730",
    pages = "1532--1537",
    booktitle = "2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009",

    }

    TY - GEN

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

    AU - Kim, Ikno

    AU - Watada, Junzo

    AU - Wu, Jui Yu

    PY - 2009

    Y1 - 2009

    N2 - 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.

    AB - 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.

    KW - Bio-inspired computation

    KW - DNA encoding method

    KW - Weighted clique

    KW - Weighted graph

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

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

    U2 - 10.1109/ICICIC.2009.10

    DO - 10.1109/ICICIC.2009.10

    M3 - Conference contribution

    SN - 9780769538730

    SP - 1532

    EP - 1537

    BT - 2009 4th International Conference on Innovative Computing, Information and Control, ICICIC 2009

    ER -