Judul: Karakterisasi Enzim Kitinase Termostabil Isolat Bacillus licheniformis MB-2 dari Tompaso, Sulawesi Utara Menggunakan Teknik Zimogram
Abstrak: Penggunaan enzim di industri saat ini menuntut tersedianya enzim yang memiliki ketahanan panas yang tinggi (termostabil). Kemampuan enzim untuk tetap stabil pada proses pemanasan menjadi hal yang penting untuk aplikasi enzim. Kitinase adalah kelompok enzim hidrolase yang dapat mendegradasi senyawa kitin yaitu polimer N-asetil-D-glukosamin yang dihubungkan dengan ikatan B-(1,4).
Keyword: 

Judul: Karakteristik enzim kitinase termostabil dari bakteri termofilik Bacillus sp. 13.26.
Abstrak: Enzim kitinase adalah kelompok enzim hidrolase yang mengkatalisis pemotongan ikatan B-1,4 pada polimer kitin. Enzim kitinase dimanfaatkan diberbagai bidang seperti pertanian, medis, pangan dan lingkungan serta untuk keperluan riset ilmu dasar. Enzim termostabil digunakan secara ekstensif oleh kalangan industri. Peluang menemukan mikroorganisme penghasil enzim kitinase untuk keperluan di atas sangat besar, karena Indonesia memiliki keragaman hayati sangat tinggi. Penelitian ini bertujuan untuk mempelajari karakteristik biokimia enzim kitinase termostabil dari bakteri termofilik Bacillus sp. 13.26 asal Tompaso, Menado, Sulawesi Utara. Isolat ditumbuhkan pada suhu 55°C di dalam medium Termus cair [0.7% (NH4)2SO4. 0.1% K₂HPO4, 0.1% NaCl, 0.01% MgSO4.7H2O, 0.05% ekstrak khamir, 0.1% bacto tripton, 0.5% koloidal kitin) pada waterbath shaker. Pada akhir fermentasi, biomassa dipisahkan dengan cara sentrifugasi (8000 g, 15 menit, 4°C). Supernatan ditampung kemudian ditambah amonium sulfat pada tingkat kejenuhan 80%. Protein dikumpulkan dengan cara sentrifugasi (9000 g, 20 menit, 4°C) dan didialisis untuk mendapatkan enzim kasar. Enzim kitinase termostabil diperoleh dengan cara memanaskan enzim kasar pada 60°C selama 3 jam. Enzim termostabil dimurnikan lebih lanjut dengan teknik khromatografi penukar ion pada DEAE Sepharose CL-6B yang dielusi secara gradien linear dengan NaCl 0-1 M di dalam bufer Tris-Cl 20 mM pH 7. Aktifitas enzim diuji dengan menentukan jumlah gula pereduksi (N-asetil glukosamin) dengan teknik spektrofotometri pada panjang gelombang 420 nm. Satu unit didefinisikan sebagai jumlah N-asetil glukosamin (umol) yang terbentuk per menit pada kondisi yang disebutkan. Hasil pemurnian dimonitor dengan SDS-PAGE (Sosium Dodecyl Sulfate-Polyacrylamide Gel Electrophoresis). Teknik zimogram diterapkan untuk menduga berat molekul enzim serta mengevaluasi termostababilitas enzim.
Keyword: Characteristic, Chitinase, Termophilic bacteria, Bacillus sp

Judul: The Construction of Greedy SVP LLL Algorithm
Abstrak: A lattice is a set of all integer linear combination of a set of linearly independent vectors in ℝ𝑛���. The independent vectors are called bases of lattice. Any lattice can be generated from many bases, and these bases have the same cardinality. In the lattice, the most fundamental and renowned problem is the Shortest Vector Problem (SVP). SVP is a tracking problem of the shortest nonzero vector in a lattice with equivalent bases. In two dimensions, SVP problem has resolved exactly by Gauss’ algorithm. When the lattice dimension is higher than two, A.K. Lenstra, H.W. Lenstra and L. Lovasz gave a LLL algorithm to compute approximation of nonzero shortest vector in the lattice. Reduced bases solution obtained from LLL algorithm still be an approximation and has polynomial running time of arbitrary dimension which large enough. In 1994, Schnoor and Euchner modified this LLL algorithm as a new variant which later was named deep insertion LLL algorithm. This algorithm is a modified version of the LLL algorithm to the terms of the exchange step to improve the accuracy of output of LLL reduced bases and applying it to the subset sum problem. The purpose of this research are: (1) Reconstruct the LLL algorithm and deep insertion LLL algorithm using a geometric approach. (2) Construct a greedy SVP LLL algorithm. (3) Implement the three algorithms in a symbolic programming language, and evaluate them experimentally. A bases ℬ=[𝐛���1,𝐛���2,…,𝐛���𝑛���] in ℝ𝑚��� is called reduced LLL with parameter 𝛿��� if satisfies: (a) |𝜇���𝑗���𝑖���|≤12, for every integer 𝑖���,𝑗��� with 1≤𝑖���<𝑗���<𝑛���. (b)𝛿���‖𝜋���𝑗���(𝐛���𝑗���)‖2≤‖𝜋���𝑗���(𝐛���𝑗���+1)‖2, for 𝑗���=1,2,…,𝑛���−1,where 𝛿��� is a reduced parameter of real numbers with 14<𝛿���<1. The first requirement is the reduced basis 𝛿��� must “nearly orthogonal” and in its computation case, this requirement can be reached out by using the Gram-Schmidt’s orthogonalization. While the second requirement is called exchange step, or used to called as Lovasz condition. By using both of these requirements, then they establish the LLL algorithm. Then, Schnoor and Euchner modify the LLL algorithm based on the requirements of the exchange step called the deep insertion LLL algorithm, where the exchange step is based on the comparison of the projected vector in orthogonal complement [𝐛���1,𝐛���2,…,𝐛���𝑘���−1]⊥ after j-th reduction. To construct greedy SVP LLL algorithm, the requirements of the exchange step is based on purely by comparing norm of lattice 𝐛���𝑗��� with norm lattice 𝐛���𝑖��� for 𝑖���=1,2,3…,𝑗���−1. The process of insertion reduced vector after the exchange step also has done greedily. Then, we calculate the number of arithmetic operation in greedy SVP LLL algorithm for further analysis. The result of our exprimentation for three algorithms on the certain matrix size shows that the running time of the three algorithms increases propotional to the size of the matrix. The result also shows that by using 𝛿���=34 for the LLL algorithm and the deep insertion LLL algorithm, and the greedy SVP LLL algorithm which is a new variant made by using no parameter of 𝛿���, outperform of the other of two previous algorithm in terms of speed with the same output.
Keyword: LLL algorithm, LLL deep insertion algorithm, greedy SVP LLL algorithm