Faster and efficient algorithm for sequence alignment
This thesis report is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2012.
| Päätekijä: | |
|---|---|
| Muut tekijät: | |
| Aineistotyyppi: | Opinnäyte |
| Kieli: | English |
| Julkaistu: |
BRAC University
2013
|
| Aiheet: | |
| Linkit: | http://hdl.handle.net/10361/2715 |
| id |
10361-2715 |
|---|---|
| record_format |
dspace |
| spelling |
10361-27152022-01-26T10:21:49Z Faster and efficient algorithm for sequence alignment Islam, Nusaiba Ali, Abu Mohammad Hammad Rashid, Farzana Department of Computer Science and Engineering, BRAC University Computer science and engineering This thesis report is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2012. Cataloged from PDF version of thesis report. Includes bibliographical references (page 31). In bioinformatics, a sequence alignment is a way of arranging the sequences of DNA, RNA, or protein to identify regions of similarity if two sequences in an alignment share a common ancestor, mismatches can be interpreted as point mutations and gaps as indels. The goal of this paper is to explore the computational approaches to sequence alignment in a faster and optimal way. Two techniques that have been studied are global alignment and local alignment. In this paper, I have used the idea of both the alignment techniques separately. Each technique follows an algorithm (Needleman – Wunsch algorithm for global alignment and Smith – Waterman algorithm for local alignment) which helps in generating proper optimal alignment accordingly. Multiple DNA sequences are read and according to alignment type, the sequences are matched. Nusaiba Islam B. Computer Science and Engineering 2013-07-10T05:33:07Z 2013-07-10T05:33:07Z 2012 2012-12 Thesis ID 09201032 http://hdl.handle.net/10361/2715 en BRAC University thesis 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. 32 pages application/pdf BRAC University |
| institution |
Brac University |
| collection |
Institutional Repository |
| language |
English |
| topic |
Computer science and engineering |
| spellingShingle |
Computer science and engineering Islam, Nusaiba Faster and efficient algorithm for sequence alignment |
| description |
This thesis report is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2012. |
| author2 |
Ali, Abu Mohammad Hammad |
| author_facet |
Ali, Abu Mohammad Hammad Islam, Nusaiba |
| format |
Thesis |
| author |
Islam, Nusaiba |
| author_sort |
Islam, Nusaiba |
| title |
Faster and efficient algorithm for sequence alignment |
| title_short |
Faster and efficient algorithm for sequence alignment |
| title_full |
Faster and efficient algorithm for sequence alignment |
| title_fullStr |
Faster and efficient algorithm for sequence alignment |
| title_full_unstemmed |
Faster and efficient algorithm for sequence alignment |
| title_sort |
faster and efficient algorithm for sequence alignment |
| publisher |
BRAC University |
| publishDate |
2013 |
| url |
http://hdl.handle.net/10361/2715 |
| work_keys_str_mv |
AT islamnusaiba fasterandefficientalgorithmforsequencealignment |
| _version_ |
1814309527829348352 |