Afuohsaa, Boris Neba <br/><br/>
DNA SEQUENCE ANALYSIS BASED ON REPETITIVE PATTERNS / 
BORIS NEBA AFUOHSAA; SUPERVISOR: PROF. DR. AHMET ADALIER 
 - viii, 65 sheets;  31 cm.  Includes CD 
<br/><br/>Thesis (MSc) - Cyprus International University. Institute of Graduate Studies and Research Information Technologies Department 
<br/><br/>Includes bibliography (sheets 51-55) 
<br/><br/> ABSTRACT<br/>The volume of DNA data evolves worldwide in various Databanks. DNA data sets <br/>increase in size because they are increasingly being gathered. The difficulty of <br/>storing large DNA data brings about two major drawbacks which are the space <br/>needed to store these data sets and the time required to encode and decode them. In <br/>order to store and process DNA data in an effective way, encryption and <br/>compression algorithms are developed. The aim of this thesis is to implement a DNA <br/>sequence compression algorithm based on repetitive patterns. This compression <br/>technique not only reduces the number of characters of the DNA sequence but <br/>equally converts the DNA sequence into binary and thus reducing the storage space <br/>consumption of one character from 1-byte to a 2-bits binary. The experiments are<br/>conducted using DNA data from National Centre for Biotechnology Information <br/>(NCBI). The minimization of transmission time is attained in sending the DNA. The <br/>end results achieved an average compression ratio of 0.77, a compression of 1.8 bpb <br/>and with an average compression time of 3 seconds. The space saving average was <br/>obtained at a value of 77%. The disarrangement of DNA sequence of any living <br/>organism could therefore be easily determined with the use of this type of <br/>compression of DNA sequences.<br/>Keywords: Algorithm, Compression, DNA, Repetitive Patterns, Sequence.<br/> 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms--Dissertations, Academic<br/>DNA--Dissertations, Academic