Ashraf, Faisal BinZaman, Shurid ShahriarKabir, Tahseen TayebIslam, Md. Al-JunaedAlam, Syed Md. Shamsul2024-11-212024-11-2120212021-01ID 17101087ID 17101417ID 17101438ID 17301133http://hdl.handle.net/10361/24811Catalogued 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.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.85 pagesenBrac University theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission.BioinformaticsMotifs recognitionDNA sequenceRNA protein sequenceHeuristic approachBioinformatics--Mathematical models.Pattern recognition.Computational biology.Nucleotide sequence.Molecular biology--Computer simulation.Thesis