Repeat Finding Techniques, Data Structures and Algorithms in DNA sequences: A Survey

سال انتشار: 1394
نوع سند: مقاله ژورنالی
زبان: انگلیسی
مشاهده: 542

فایل این مقاله در 9 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

JR_ACSIJ-4-5_007

تاریخ نمایه سازی: 7 آذر 1394

چکیده مقاله:

DNA sequencing technologies keep getting faster and cheaper leading to massive availability of entire human genomes. This massive availability calls for better analysis tools with a potentialto realize a shift from reactive to predictive medicine. The challenge remains, since the entire human genomes need morespace and processing power than that can be offered by a standard Desktop PC for their analysis. A background of keyconcepts surrounding the area of DNA analysis is given and areview of selected prominent algorithms used in this area. The significance of this paper would be to survey the conceptssurrounding DNA analysis so as to provide a deep rooted understanding and knowledge transfer regarding existingapproaches for DNA analysis using Burrows-Wheeler transform, Wavelet tree and their respective strengths and weaknesses. Consequent to this survey, the paper attempts to provide some directions for future research

نویسندگان

Freeson Kaniwa

Department of Computer Science, Botswana International University of Science and Technology Private Bag ۱۶, Palapye, Botswana

Heiko Schroeder

Department of Computer Science, Botswana International University of Science and Technology Private Bag ۱۶, Palapye, Botswana

Otlhapile Dinakenyane

Department of Computer Science, Botswana International University of Science and Technology Private Bag ۱۶, Palapye, Botswana