Perbandingan Needleman-Wunsch dan Lempel-Ziv dalam Teknik Global Sequence Alignment: Keunggulan Faktorisasi Sempurna
Abstract: Bioinformatics
research is currently working on the changing of the DNA information, and
marking the mutation for the DNA. For comparing DNA and finding out how two DNA
can have similarities, bioinformatics using algorithms that works in global
alignment and local alignment. The global alignment is comparing all the
characters in sequence while the local only take a piece of characters from the
alignment. This study proposes two
algorithms for processing the DNA sequence in global alignment. The akgorithms
are Needleman-Wunsch and Lempel-Ziv algorithms. These algorithms work with
building a scoring matrix and create an alignment based on the matrix. The
experiment is conducted by testing 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, while Lempel-Ziv is
leading the processing speed on specific case of perfect phrase in DNA
sequence.
Keywords: Bioinformatics, Needleman-Wunsch,
Lempel-Ziv, sequence alignment algorithms, perfect phrase
Penulis: Mikhael Avner
Malendes, Hendra Bunyamin
Kode Jurnal: jptinformatikadd170248
