Ditemukan 4 dokumen yang sesuai dengan query
One of the dominant problems in computational molecular biology is
multiple sequence alignment (MSA) of DNA. Many methods have been
proposed to solve MSA problem such as dynamic programming and heuristic.
A method has been proposed by Althaus et al. to solve MSA problem which is
based on integer linear programming (ILP). The general...
Universitas Indonesia, 2008
S-Pdf
UI - Skripsi (Membership) Universitas Indonesia Library
This skripsi discusses a method known DIALIGN to find the best alignment of two DNA sequences. This algorithm is based on segment-tosegment comparison instead of the commonly used residue-to-residue comparison. Also, this algorithm avoids the wellknown difficulties concerning the choice of appropriate gap penalties. In DIALIGN, all possible diagonals of...
Universitas Indonesia, 2008
S-Pdf
UI - Skripsi (Membership) Universitas Indonesia Library
Penyejajaran barisan DNA dilakukan dengan tujuan melihat tingkat kemiripan antara barisan DNA. Pada tugas akhir ini, dilakukan penyejajaran barisan DNA dengan menggunakan algoritma X-drop dan algoritma greedy. Algoritma X-drop melakukan penyejajaran barisan DNA dengan menggunakan pendekatan pemrograman dinamik. Algoritma greedy merupakan modifikasi algoritma X-drop.
Kedua algoritma ini bekerja dengan menelusuri penyejajaran...
Universitas Indonesia, 2009
S-Pdf
UI - Skripsi (Membership) Universitas Indonesia Library
Multiple sequence alignment (MSA) is a sequence alignment of three or more biological sequences, which are assumed to have an evolutionary relationship. Because three or more sequences of biologically relevant length can be difficult and are almost always time-consuming to align by hand, computational algorithm are used to produce and...
Universitas Indonesia, 2008
S-Pdf
UI - Skripsi (Membership) Universitas Indonesia Library
