Judul: Karakterisasi mutan Bradyhizobium japonicum sensitif asam alumunium yang dihasilkan melalui mutagenesis dengan transposon
Abstrak: Gen yang diduga memiliki peranan dalam toleransi asam alumunium pada tiga galur Bradyrhizobium japonicum (Bj11, Bj38, dan KDR15) toleran asam A1 dikaji lebih lanjut untuk lebih memahami mengenai mekanisme toleransinya. Transposon mini - Tn5Km1 pembawa gen resistensi kanamisin (Km1) yang dibawa plasmid pUTmini-Tn5Km1 dalam E.coli S17-1 (hpir)(donor) dipindahkan ke B. japonicum (resipien) dengan konjugasi secara diparental mating.
Keyword: 

Judul: Seleksi Galur-Galur Bradyrhizobium Japonicum Toleran Asam-Aluminium
Abstrak: Bradyrhizobium japonicum merupakan bakteri penambat molekul nitrogen bebas (N2) yang bersimbiosis dengan akar tanaman kedelai dengan cara memben- tuk bintil. Bakteri ini berpotensi untuk meningkatkan produksi kedelai ter- utama pada lahan asam, melalui simbiosis antara B. japonicum toleran asam dengan kedelai yang juga toleran asam. Bradyrhizobium japonicum toleran asam yang diperoleh melalui skrining mikrobiologis dan kemampuannya berkompetisi dalam membentuk bintil akar dapat dievaluasi dengan menggunakan penanda molekuler yang stabil dan handal. Penanda molekuler yang dapat digunakan untuk menelaah aktivitas bakteri di habitat alaminya, antara lain adalah gen inaZ pada plasmid pJL1703, gen xylE pada plasmid pXYLE1, dan gen resistensi kanamisin dari Tn903 yang dibawa transposon mini-Tn5 (pUTmini-Tn5Kan). Penanda molekuler terpilih adalah yang paling stabil dan mampu diekspresikan oleh B. japonicum. Penelitian ini bertujuan : (i) menganalisis kemampuan galur-galur B. japo- nicum toleran asam mengekpresikan gen inaZ, gen xylE dan gen KanR serta kemampuannya dalam membentuk bintil akar, (ii) menentukan gen yang dapat digunakan sebagai penanda molekuler pada B. japonicum, (iii) menelaah kompetisi galur-galur B. japonicum toleran asam dalam membentuk binti akar kedelai dengan menggunakan penanda molekuler yang sesuai. Ketiga gen penanda tersebut masing-masing ditransfer ke B. japonicum dengan teknik konjugasi. Pemindahan gen inaZ dan gen xylE dilakukan secara triparental mating, sedangkan gen Kan secara diparental mating. Mating dilaku- kan di atas filter millipore dengan pori-pori 0.45 um di atas media Luria Agar (LA) yang dimodifikasi…dst
Keyword: Bradyrhizobium Japonicum, Bakteri  Bintil Akar, Konjugasi, Penanda Molekul

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