Kajian komputasi paralel pada algoritma tree based of consistency objective function for evaluation alignment (T-coffee) dalam masalah multiple sequence alignment = A study parallel on computation of tree based of consistency objective function for evaluation alignment (T-coffee ) in multiple sequence alignment problems
(Universitas Indonesia, 2013)
|
| [Tree Based Of Consistency Objective Function For Evaluation Alignment(T-COFFEE) merupakan algoritma untuk menyelesaikan permasalahan multiple sequence alignment (MSA). Algoritma ini menggabungkan dua teknik, pertama Tree Based yang merupakan Progressive Alignment dan kedua Consistency Objective Function berupa extending library. Pada pembahasan skripsi ini akan digunakan data sequence dari database ensembl yang terdiri dari database DNA atau protein yang akan diproses dengan global alignment (Needleman-Wunsch) dan local alignment (Smith- Waterman) dengan harapan informasi yang dihasilkan pada akhir pensejajaran akan menggambarkan hasil penyejajaran yang optimal. Proses pembentukan primary dan extended library pada T-COFFEE membutuhkan waktu lama sehingga untuk mempercepat waktu proses T-COFFEE digunakan teknik komputasi paralel Graphic Processing Unit (GPU). Skripsi ini akan menjelaskan algoritma T-COFFEE, algoritma paralel T-COFFEE, serta mengukur efisiensi dari kedua algoritma tersebut., Tree Based Of Consistency Objective Function For Evaluation Alignment(T-COFFEE) is an algorithm to solve the problem of multiple sequence alignment (MSA). This algorithm combines two techniques, first is Tree-Based with Progressive Alignment and second is Consistency of Objective Function by extending library. In this skripsi, we use the data from the ensembl database that consisting of DNA or protein data. Those data will be processed by the global alignment (Needleman-Wunsch) and local alignment (Smith-Waterman) that is expected to give optimal alignment result at the end of the alignment process. The generating of Primary and Extended Library is the most time consuming, hence to speed up the T-COFFEE process, a parallel version of T-COFFEE algorithm is needed by implementing parallel computing on Graphic Processing Unit (GPU). In this skripsi, the T-COFFEE algorithm, the parallel T-COFFEE algorithm, and the measurement of their speed up and efficiency will be discuss.] |
 S54325-Muhammad Fauzan.pdf :: Unduh
|
| No. Panggil : | S54325 |
| Subjek : | |
| Penerbitan : | [Place of publication not identified]: Universitas Indonesia, 2013 |
| Program Studi : |
| Bahasa : | ind |
| Sumber Pengatalogan : | |
| Tipe Konten : | |
| Tipe Media : | |
| Tipe Carrier : | |
| Deskripsi Fisik : | xiv, 84 hlm. : ill. ; 30 cm. + lamp. |
| Naskah Ringkas : | |
| Lembaga Pemilik : | Universitas Indonesia |
| Lokasi : | Perpustakaan UI, Lantai 3 |
| No. Panggil | No. Barkod | Ketersediaan |
|---|---|---|
| S54325 | TERSEDIA |
| Ulasan: |
| Tidak ada ulasan pada koleksi ini: 20368786 |
