An Efficient Linear Seeded Tree Algorithm For Finding The Similarity Score of Two RNA Secondary Structures

We are thankful to Almighty Allah for his blessings for the successful completion of our thesis. Ourheartiestgratitude,profoundindebtednessanddeeprespectgotooursupervisor, LieutenantColonelMd. MahboobKarim,psc,InstructorClassA,DepartmentofComputer Science & Engineering (CSE), Military Institute of S...

Mô tả đầy đủ

Đã lưu trong:
Chi tiết về thư mục
Những tác giả chính: Noor, Rifat Ara, Jawed, Farha Binte, Sharna, Afia Sultana
Định dạng: Luận văn
Ngôn ngữ:Tiếng Anh
Được phát hành: Department of Computer Science and Engineering, Military Institute of Science and Technology 2015
Những chủ đề:
Truy cập trực tuyến:http://hdl.handle.net/123456789/146
Các nhãn: Thêm thẻ
Không có thẻ, Là người đầu tiên thẻ bản ghi này!
_version_ 1868227005542039552
author Noor, Rifat Ara
Jawed, Farha Binte
Sharna, Afia Sultana
author_browse Jawed, Farha Binte
Noor, Rifat Ara
Sharna, Afia Sultana
author_facet Noor, Rifat Ara
Jawed, Farha Binte
Sharna, Afia Sultana
author_sort Noor, Rifat Ara
collection DSpace
description We are thankful to Almighty Allah for his blessings for the successful completion of our thesis. Ourheartiestgratitude,profoundindebtednessanddeeprespectgotooursupervisor, LieutenantColonelMd. MahboobKarim,psc,InstructorClassA,DepartmentofComputer Science & Engineering (CSE), Military Institute of Science & Technology (MIST) for his constant supervision, affectionate guidance and great encouragement and motivation. His keen interest on the topic and valuable advices throughout the study was of great help in completing thesis. We are thankful to our co-supervisor Md. Shamsur Rahman, Doctoral Student (Ph.D. Candidate), Clayton School of Information Technology, Monash University, Clayton, Victoria, Australia for his continuous guidance & support. We are especially grateful to the Department of Computer Science and Engineering (CSE) of Military Institute of Science and Technology (MIST) for providing their all out support during the thesis work. Finally, we would like to thank our families and our course mates for their appreciable assistance, patience and suggestions during the course of our thesis.
format Thesis
id oai:localhost:123456789-146
institution My University
language English
publishDate 2015
publishDateRange 2015
publishDateSort 2015
publisher Department of Computer Science and Engineering, Military Institute of Science and Technology
publisherStr Department of Computer Science and Engineering, Military Institute of Science and Technology
record_format dspace
spelling oai:localhost:123456789-1462015-07-02T08:37:54Z An Efficient Linear Seeded Tree Algorithm For Finding The Similarity Score of Two RNA Secondary Structures Noor, Rifat Ara Jawed, Farha Binte Sharna, Afia Sultana Efficient, Linear,Seeded, Algorithm, RNA, Structures We are thankful to Almighty Allah for his blessings for the successful completion of our thesis. Ourheartiestgratitude,profoundindebtednessanddeeprespectgotooursupervisor, LieutenantColonelMd. MahboobKarim,psc,InstructorClassA,DepartmentofComputer Science & Engineering (CSE), Military Institute of Science & Technology (MIST) for his constant supervision, affectionate guidance and great encouragement and motivation. His keen interest on the topic and valuable advices throughout the study was of great help in completing thesis. We are thankful to our co-supervisor Md. Shamsur Rahman, Doctoral Student (Ph.D. Candidate), Clayton School of Information Technology, Monash University, Clayton, Victoria, Australia for his continuous guidance & support. We are especially grateful to the Department of Computer Science and Engineering (CSE) of Military Institute of Science and Technology (MIST) for providing their all out support during the thesis work. Finally, we would like to thank our families and our course mates for their appreciable assistance, patience and suggestions during the course of our thesis. The comparison between two RNA secondary structures is done to predict class and functionalities of unknown organisms and to analyze similarities between them. In previous method of finding similarity scores between two RNA secondary structures, seeded tree alignment algorithm of time complexity O(n3) is used. Here a large RNA tree is converted into a smaller tree known as seeded tree. After that seeded tree alignmentalgorithmisusedtofindsimilaritybetweeneachseedpairsandfinallytheoverall trees. Butinthatmethodnodesateachlevelofsubtreesofseedsarenotalignedandthus itisnot alwayspossibleto obtainaccurateresult. Here, weintroduceanewmethodfor comparing and finding similarity scores between two RNA secondary structures using linearalignmentalgorithm. WeusethepreviousmethodsofconvertingRNAsecondary structure to RNA tree, RNA tree to seeded tree and seeded tree to normalized weighted tree. Then we use our proposed linear alignment algorithm to align each and every nodes of subtrees of seed pairs and compute similarity score between every seed pairs. Finally seeded tree alignment algorithm is used to align and compute similarity score of the whole seeded trees. Although it has the same time complexity as the previous method, it works linearly with multiple alignments and yields to probable correct result. The algorithm is justified by computing similarities among several well-known RNA secondary structures. Department of Computer Science & Engineering (CSE), Military Institute of Science & Technology (MIST) 2015-07-02T08:37:54Z 2015-07-02T08:37:54Z 2014-12 Thesis http://hdl.handle.net/123456789/146 en B.Sc. in Computer Science and Engineering Thesis; application/octet-stream Department of Computer Science and Engineering, Military Institute of Science and Technology
spellingShingle Efficient, Linear,Seeded, Algorithm, RNA, Structures
Noor, Rifat Ara
Jawed, Farha Binte
Sharna, Afia Sultana
An Efficient Linear Seeded Tree Algorithm For Finding The Similarity Score of Two RNA Secondary Structures
title An Efficient Linear Seeded Tree Algorithm For Finding The Similarity Score of Two RNA Secondary Structures
title_full An Efficient Linear Seeded Tree Algorithm For Finding The Similarity Score of Two RNA Secondary Structures
title_fullStr An Efficient Linear Seeded Tree Algorithm For Finding The Similarity Score of Two RNA Secondary Structures
title_full_unstemmed An Efficient Linear Seeded Tree Algorithm For Finding The Similarity Score of Two RNA Secondary Structures
title_short An Efficient Linear Seeded Tree Algorithm For Finding The Similarity Score of Two RNA Secondary Structures
title_sort efficient linear seeded tree algorithm for finding the similarity score of two rna secondary structures
topic Efficient, Linear,Seeded, Algorithm, RNA, Structures
url http://hdl.handle.net/123456789/146
work_keys_str_mv AT noorrifatara anefficientlinearseededtreealgorithmforfindingthesimilarityscoreoftwornasecondarystructures
AT jawedfarhabinte anefficientlinearseededtreealgorithmforfindingthesimilarityscoreoftwornasecondarystructures
AT sharnaafiasultana anefficientlinearseededtreealgorithmforfindingthesimilarityscoreoftwornasecondarystructures
AT noorrifatara efficientlinearseededtreealgorithmforfindingthesimilarityscoreoftwornasecondarystructures
AT jawedfarhabinte efficientlinearseededtreealgorithmforfindingthesimilarityscoreoftwornasecondarystructures
AT sharnaafiasultana efficientlinearseededtreealgorithmforfindingthesimilarityscoreoftwornasecondarystructures