Search In this Thesis
   Search In this Thesis  
العنوان
On Algorithms for RNA Structure Comparison Problems /
المؤلف
Kenawy, Tarek Gamal Ahmed.
هيئة الاعداد
باحث / طارق جمال أحمد قناوي
مشرف / حاتم محمد بهيج
مشرف / محمد هاشم علي عبد الرحمن
تاريخ النشر
2022.
عدد الصفحات
130 p. :
اللغة
الإنجليزية
الدرجة
ماجستير
التخصص
Computational Theory and Mathematics
تاريخ الإجازة
1/1/2022
مكان الإجازة
جامعة عين شمس - كلية العلوم - الرياضيات
الفهرس
Only 14 pages are availabe for public view

from 130

from 130

Abstract

Due to the importance of the comparison of RNA structures, from molecular biology and computer science viewpoints, we focus in this thesis on the frameworks and algorithms used to find the similarity between two RNA structures. To verfiy this goal, the thesis consists of an introduction, five chapters, one appendix, and a bibliography as follows:
Introduction : It briefly explains the concept of RNA structure comparison and its importance from different viewpoints.
Chapter One: This chapter presents a brief overview of some biological fundamentals related to RNA. The chapter includes the fundamentals of DNA, RNA, protein, and RNA structure.
Chapter Two: This chapter introduces the main paradigms that have been proposed so far for the two RNA structure comparison frameworks and algorithmic results for these paradigms.
Chapter Three: This chapter presents the proposed heuristic algorithm for the longest arc-preserving common subsequence problem where the two types of arcs are crossing and plain. The chapter includes the main idea, the pseudocode of the proposed algorithm, complexity analysis of the proposed algorithm, and the results of the experimental study using different arguments to prove that the proposed algorithm is efficient compared to the existing fast
xv
xvi
heuristic algorithm.
Chapter Four : This chapter studies the performance of three heuristic algorithms compared to the only known exact algorithm for RNA structure of type nested-plain. The comparison concerns with three factors: (1) output accuracy (2) time consumption (3) storage consumption.
Chapter Five: This chapter summarizes the main results presented in this thesis. The suggestions for research points to be conducted and attempting to solve in the future are also provided.
Appendix A: This appendix contains a short description of some previous algorithms for the longest arc-preserving common subequence problem.