Judul: Penambatan Molekul Flavonoid dan Asam Fenolat Kurma (Phoenix Dactylifera) dengan Xantin Oksidase
Abstrak: Tengah. Kurma mengandung asam fenolat dan flavonoid yang memiliki kemampuan antioksidan dan dapat menginhibisi kerja xantin oksidase. Penelitian ini bertujuan mengetahui interaksi molekuler xantin oksidase oleh senyawa asam fenolat dan flavonoid kurma menghambat kerja xantin oksidase dalam memproduksi asam urat. Penelitian dilakukan dengan metode in silico yaitu penambatan terarah (site directed docking). Ukuran pusat penambatan yang digunakan dalam penelitian ini sebesar x = 26.569, y = 9.985, dan z = 113.088 dan volume penambatan sebesar x = 14, y = 14, dan z = 16. Penghambatan oleh senyawa golongan flavonoid dan asam fenolat yang dilakukan menghasilkan kekuatan inhibisi yang baik ditunjukkan dengan energi bebas Gibbs yang bernilai negatif. Senyawa dengan nilai energi bebas Gibbs tertinggi yaitu senyawa antosianin yaitu sebesar -7.3 kKal/mol, nilai tersebut lebih tinggi dari ligan pembanding allopurinol. Berdasarkan analisis ikatan yang terbentuk, senyawa terbaik dalam menginhibisi xantin oksidase yaitu asam siringat.
Keyword: Asam fenolat, flavonoid, kurma, penambatan molekuler, xantin oksidase

Judul: Penambatan Molekuler Xantin Oksidase oleh Senyawa Aktif Sirih Merah (Piper crocatum) sebagai Pengobatan Alternatif Asam Urat
Abstrak: Produksi asam urat berlebih di dalam tubuh dapat mengendap di persendian dan menimbulkan rasa nyeri dan kaku sehingga sendi mengalami pembengkakan. Penghambatan enzim xantin oksidase diketahui mampu menjadi jalan terapi dalam menghambat produksi asam urat. Penelitian ini bertujuan mengidentifikasi interaksi molekuler xantin oksidase oleh senyawa aktif sirih merah yang berpotensi dalam menghambat aktivitas enzim xantin oksidase sebagai pengobatan alternatif asam urat. Penelitian dilakukan dengan metode in silico yaitu penambatan terarah (site directed docking). Ukuran pusat penambatan yang digunakan dalam penelitian ini sebesar x=26,7853; y= 9,9800; z= 113,3917 dengan nilai dimensi x=14 ; y=14 ; z=18. Potensi inhibisi terbaik dimiliki oleh sofalkon, asam protokatekuat, dan 2-(3,4-dimetoksi fenil)-6-etoksi-7- metoksi-1-naftol dengan nilai ∆G dan Ki yang lebih baik dibanding allopurinol serta memiliki interaksi residu yang cukup kuat terhadap sisi aktif xantin oksidase, Excess uric acid production in the body can settle in the joints and cause pain and stiffness si that the joints experience swelling. Inhibitoin of the xanthine oxidase enzym is known to be abe to be a therapeuticroute in inhibiting uric acid production. This research aims to identify the molecular interactions of xanthine oxidase by red betel compounds which had the potential to inhibit the activity of xanthine oxidase enzyme as an alternative treatment for gout. The research was conducted using in silico method by site-directed docking. The size of the center retardation used in this research was x= 26,7853; y= 9,9800; z= 113,3917 with dimension value x= 14; y= 14; z= 18. The best inhibition potential was sofalcone, protocatechuic acid, and 2-(3,4-dimethoxy phenyl)-6-ethoxy-7- methoxy-1-naphtol with better ∆G and Ki values than allopurinol and had a fairly strong residual interaction with the active site of xanthine oxidase.
Keyword: molecular docking, red betel, uric acid, xanthine oxidase

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