DSpace Repository

Efficient seeded tree alignment algorithm for finding similarity between two RNA secondary structures

Show simple item record

dc.contributor.advisor Abul Kashem Mia, Dr. Md.
dc.contributor.author Shamsur Rahman, Mohammad
dc.date.accessioned 2016-10-23T06:32:01Z
dc.date.available 2016-10-23T06:32:01Z
dc.date.issued 2010-05
dc.identifier.uri http://lib.buet.ac.bd:8080/xmlui/handle/123456789/3938
dc.description.abstract This thesis presents an efficient O(n3) time algorithm for solving the seeded tree alignment problem that finds the similarity between two RNA secondary structures. In the seeded tree alignment problem, a large tree, representing an RNA secondary structure, is converted into a small tree known as seeded tree. In this problem, a comparison operation is being placed to find the similarity between necessary seed pair of two seeded trees and finally the overall trees. Before finding the similarity score between seed pairs, it is necessary to rearrange all primary seeds in planar way to form untanglegram whenever the primary seeds are arranged in heavily non planar way. Our proposed algorithm is more efficient than the best known algorithm that needs O(n3.5) time. Moreover, our algorithm can solve the seeded tree alignment problem efficiently in O(n3) time even if the two seeded trees form heavy tanglegram. en_US
dc.language.iso en en_US
dc.publisher Institute of Information and Communication Technology (IICT) en_US
dc.subject Algorithms-DNA -RNA sequence en_US
dc.title Efficient seeded tree alignment algorithm for finding similarity between two RNA secondary structures en_US
dc.type Thesis-MSc en_US
dc.contributor.id M 10063116 P en_US
dc.identifier.accessionNumber 108786
dc.contributor.callno 006.31/SAM/2010 en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search BUET IR


Advanced Search

Browse

My Account