Malendes, Mikhael Avner and Bunyamin, Hendra (2017) Perbandingan Needleman-Wunsch dan Lempel-Ziv dalam Teknik Global Sequence Alignment: Keunggulan Faktorisasi Sempurna. Jurnal Teknik Informatika dan Sistem Informasi (JuTISI), 3 (1). pp. 1-12. ISSN e-ISSN: 2443-2229
![]() |
Text
27. Mikhael_Hendra_Perbandingan Needleman-Wunsch dan Lempel-Ziv dalam Teknik Global Sequence Alignment Keunggulan Faktorisasi Sempurna.pdf - Published Version Restricted to Registered users only Download (1MB) | Request a copy |
Abstract
Essentially research on bioinformatics discusses the changing of the DNA information, and marking the mutation for the DNA. Comparing DNA and finding out how two DNA can have similarities, bioinformatics utilizeds algorithms that work on global alignment and local alignment. The global alignment compares all the characters in a sequence; on the other hand, the local one only takes a piece of characters from the alignment. This study proposes two algorithms for processing the DNA sequence in global alignment that are Needleman-Wunsch and Lempel-Ziv algorithms. These algorithms work with building a scoring matrix and creating an alignment based on the matrix. We test DNA sequences randomly with the length less than 1000 characters and more than 1000 characters. Needleman-Wunsch leading with processing speed up to 1 miliseconds for less than 1000 character dataset and 42 miliseconds for more than 1000 characters dataset. However, Lempel-Ziv is leading the processing speed on specific case of perfect phrase in DNA sequence.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Bioinformatics, Needleman-Wunsch, Lempel-Ziv, sequence alignment algorithms, perfect phrase |
Subjects: | T Technology > T Technology (General) |
Divisions: | Fakultas Teknologi Informasi > S-1 Teknik Informatika |
Depositing User: | admin LPPM |
Date Deposited: | 16 Aug 2017 02:19 |
Last Modified: | 16 Aug 2017 02:19 |
URI: | http://repository.lppm.maranatha.edu/id/eprint/177 |
Actions (login required)
![]() |
View Item |