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 ILP formulation of
the MSA is derived from the graph representation of the MSA problem.
Although we have the general ILP formulation of the MSA problem,
constructing the ...
"
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 the input sequences will be weighted and compared to find the diagonals which compose optimal alignment. Diagonal weight is based on match
probability of residues in ...
"
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 yang tidak memenuhi kondisi X-drop, yaitu kondisi yang bergantung pada nilai X yang dipilih oleh pengguna, sehingga kinerja dari kedua algoritma ini bergantung pada pemilihan ...
"
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 analyze the alignments. Computational algorithm can be constructed by transforming multiple sequence alignment problems into graph problems. The problem of finding an
optimal alignment turns into ...
"
Universitas Indonesia, 2008
S-Pdf
UI - Skripsi Membership Universitas Indonesia Library
