In this paper, we used a new operation in a Genetic Algorithm for solving the binary Knapsack problem depending on it's LP Relaxation solution after eliminating the fractional part of the non-binary values. The benefit is to make a filter to the initial random population from the farness of the optimal solution and unsuitable chromosomes. This good property will be fixed automatically in all generations in the Genetic Algorithm until reaching the optimal binary solution.
DNA Sequence Alignment is an important problem in computational biology and is useful for comparing genomes and finding genes, for determining evolutionary linkage of different biological sequences. Dynamic Programming Problems is discussed and applied to solve this problem. This paper is concerned with computing DNA Sequence Alignment firstly by formulating a Binary Integer Programming model to compute the string sequence in Edit Distance Problem then re-formulating this model to be suitable to compute this alignment. By this model we gave a good role for Operations Researches field to prove it's efficient to solve problems of molecule of life. The suggested model is applied to solve an example in Edit Distance Problem then used again after re-formulating it for an example in DNA Sequence Alignment Problem.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.