Welcome to the upgraded BRAC University Institutional Repository. We are currently organizing collections after a recent system upgrade. Homepage category counters may temporarily show lower numbers while syncing, but over 27,000 repository items remain safe and accessible. Please use the search bar to find theses, scholarly outputs, and institutional documents.

Finding motifs from DNA sequence using heuristic approach

bracu.degree.levelUndergraduate
bracu.type.groupStudent Works
datacite.rightsOpen Access
dc.contributor.advisorAshraf, Faisal Bin
dc.contributor.authorZaman, Shurid Shahriar
dc.contributor.authorKabir, Tahseen Tayeb
dc.contributor.authorIslam, Md. Al-Junaed
dc.contributor.authorAlam, Syed Md. Shamsul
dc.contributor.departmentDepartment of Computer Science and Engineering
dc.date.accessioned2024-11-21T06:29:43Z
dc.date.available2024-11-21T06:29:43Z
dc.date.copyright2021
dc.date.issued2021-01
dc.descriptionCatalogued from PDF version of thesis.
dc.descriptionIncludes bibliographical references (pages 40-42).
dc.descriptionThis thesis is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2021.en_US
dc.description.abstractFinding 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.en_US
dc.description.degreeBachelor of Science in Computer Science and Engineering
dc.description.statementofresponsibilityShurid Shahriar Zaman
dc.description.statementofresponsibilityTahseen Tayeb Kabir
dc.description.statementofresponsibilityMd. Al-Junaed Islam
dc.description.statementofresponsibilitySyed Md. Shamsul Alam
dc.format.extent85 pages
dc.identifier.otherID 17101087
dc.identifier.otherID 17101417
dc.identifier.otherID 17101438
dc.identifier.otherID 17301133
dc.identifier.urihttp://hdl.handle.net/10361/24811
dc.language.isoenen_US
dc.publisherBRAC Universityen_US
dc.rightsBrac 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.
dc.subjectBioinformaticsen_US
dc.subjectMotifs recognitionen_US
dc.subjectDNA sequenceen_US
dc.subjectRNA protein sequenceen_US
dc.subjectHeuristic approachen_US
dc.subject.lcshBioinformatics--Mathematical models.
dc.subject.lcshPattern recognition.
dc.subject.lcshComputational biology.
dc.subject.lcshNucleotide sequence.
dc.subject.lcshMolecular biology--Computer simulation.
dc.titleFinding motifs from DNA sequence using heuristic approachen_US
dc.typeThesisen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
17101087, 17101417, 17101438, 17301133_CSE.pdf
Size:
3.6 MB
Format:
Adobe Portable Document Format
Description:

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: