Journals Proceedings

Abstract

It is a well-known fact that the DNA mutation plays a very important role in DNA sequence evolution. The backtracking problem of DNA sequence evolution in one dimensional cellular automata (CA) has ben recognized as a NP problem. In this research, a newly developed bioinformatics approach constructs a DNA sequence evolution model in using one dimensional cellular automata. Its corresponding backtracking of DNA sequence evolution is accomplished by an order-finding bioinformatics algorithm for efficient operations. The time complexity of a proposed bioinformatics approach for DNA sequence evolution in one dimensional cellular automata is found in O(n2) polynomial bound. Our newly developed algorithms for solving backtracking of DNA sequence evolution in one dimensional CA are also in O(n2) polynomial bound.