Please use this identifier to cite or link to this item: http://repository.i3l.ac.id/jspui/handle/123456789/1080
Full metadata record
DC FieldValueLanguage
dc.contributor.authorStepanus, Agustinus-
dc.date.accessioned2025-02-25T03:15:45Z-
dc.date.available2025-02-25T03:15:45Z-
dc.date.issued2024-09-01-
dc.identifier.urihttp://repository.i3l.ac.id/jspui/handle/123456789/1080-
dc.description.abstractAs the availability of genome sequencers increases, the number of genome data needed to be stored increases exponentially. A strategy to manage this problem is needed. One of the solutions is through a genome compressor. This study proposes a data splitting process on the input of the LZ78 algorithm to increase the redundancy which potentially increases the compression performance of the algorithm. AT and GC characters are split into two different substrings. Other additional ambiguity characters were also assigned to the substrings. The last substring was a mapping to the position of characters of the first and second substrings located in the original sequence. The proposed algorithm successfully reduced the compression time and decompression memory peak. However, the compression ratio did not significantly differ from the original LZ78 algorithm. The proposed algorithm’s compression ratio was also not able to compete with the current available FASTA compressor, but the effect of the proposed algorithm on the LZ78 algorithm might be able to be implemented on other algorithms with the basis of the LZ-like algorithm.en_US
dc.language.isoenen_US
dc.publisherIndonesia International Institute for life scienceen_US
dc.subjectFASTAen_US
dc.subjectLZ78en_US
dc.subjectcompressionen_US
dc.titleThe Effect of Fasta Sequence Splitting with The Addition of Binary Position Mapping to LZ78 Algorithm for Single Genome Compressionen_US
dc.typeThesisen_US
Appears in Collections:Bioinformatics

Files in This Item:
File Description SizeFormat 
Agustinus Stepanus.pdf
  Restricted Access
Full text995.24 kBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.