Finding motifs from DNA sequence using heuristic approach

Abstract

Finding patterns of the short sequences in DNA, RNA protein sequence has immense biological signi cance. The characterization and recognition of motifs is therefore an important method for a more in-depth understanding of genes or proteins in their structure, function and relations of evolution. This is one of the classical problems in the eld of computational biology and which is an NP Hard problem. In this paper, we have proposed an evolutionary approach to get the motifs from DNA sequence by searching candidate motifs using heuristic way from the data. We have included various mutation techniques in an evolutionary approach and found an e cient way to calculate the tness of our candidate motifs. We have evaluated the tness of found motifs from our approach with benchmark data sets. Our method performs better results in terms of accuracy and speci city.

Description

Catalogued from PDF version of thesis.
Includes bibliographical references (pages 40-42).
This thesis is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2021.

Keywords

Bioinformatics, Motifs recognition, DNA sequence, RNA protein sequence, Heuristic approach

Citation

Endorsement

Review

Supplemented By

Referenced By