DNA SEQUENCE ANALYSIS BASED ON DNABIT ALGORITHM
Afolabi, Gbolahan Salam
DNA SEQUENCE ANALYSIS BASED ON DNABIT ALGORITHM GBOLAHAN SALAM AFOLABI; SUPERVISOR: PROF. DR. AHMET ADALIER - viii, 71 sheets; 31 cm. 1 CD-ROM
Thesis (MSc) - Cyprus International University. Institute of Graduate Studies and Research Information Technologies Department
Includes bibliography (sheets 46-50)
ABSTRACT
The amount of DNA data changes globally in different data banks. DNA datasets get
bigger because more of them are being collected. Two significant problems result from
the difficulty of keeping huge DNA data sets: the amount of space needed to store
these data sets and the amount of time needed to encode and decode them. Algorithms
for encryption, decryption and compression have been developed in order to store and
process DNA data effectively. DNA compression entails utilizing fewer bits than the
original representation to encode information. This thesis introduces a DNA sequence
compression approach based on the DNABIT algorithm. By evaluating the pre-defined
protein sequences and replacing them with a Binary entity, the compression method
decreases the characters in a DNA sequence. This study was carried out utilizing DNA
information from the National Center for Biotechnology Information (NCBI). We
were able to achieve an average compression ratio of 0.797, average space saving
percentage of 80% within a minimal compression time. The DNA sequence of any
living organism, virus or bacteria can therefore be easily determined with the use of
this type of compression of DNA sequences.
Keywords: Algorithm, Binary, Bit, Byte, Conversion, Compression, Decryption,
DNA, Encryption, Patterns, Repetitive, Sequence.
Algorithms--Dissertations, Academic
Conversion--Dissertations, Academic
Data compression (Computer science)--Dissertations, Academic
DNA--Dissertations, Academic
DNA SEQUENCE ANALYSIS BASED ON DNABIT ALGORITHM GBOLAHAN SALAM AFOLABI; SUPERVISOR: PROF. DR. AHMET ADALIER - viii, 71 sheets; 31 cm. 1 CD-ROM
Thesis (MSc) - Cyprus International University. Institute of Graduate Studies and Research Information Technologies Department
Includes bibliography (sheets 46-50)
ABSTRACT
The amount of DNA data changes globally in different data banks. DNA datasets get
bigger because more of them are being collected. Two significant problems result from
the difficulty of keeping huge DNA data sets: the amount of space needed to store
these data sets and the amount of time needed to encode and decode them. Algorithms
for encryption, decryption and compression have been developed in order to store and
process DNA data effectively. DNA compression entails utilizing fewer bits than the
original representation to encode information. This thesis introduces a DNA sequence
compression approach based on the DNABIT algorithm. By evaluating the pre-defined
protein sequences and replacing them with a Binary entity, the compression method
decreases the characters in a DNA sequence. This study was carried out utilizing DNA
information from the National Center for Biotechnology Information (NCBI). We
were able to achieve an average compression ratio of 0.797, average space saving
percentage of 80% within a minimal compression time. The DNA sequence of any
living organism, virus or bacteria can therefore be easily determined with the use of
this type of compression of DNA sequences.
Keywords: Algorithm, Binary, Bit, Byte, Conversion, Compression, Decryption,
DNA, Encryption, Patterns, Repetitive, Sequence.
Algorithms--Dissertations, Academic
Conversion--Dissertations, Academic
Data compression (Computer science)--Dissertations, Academic
DNA--Dissertations, Academic