A DNA Encoding Method to Determine and Sequence All Cliques in a Weighted Graph

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.