Judul: Analisis Morfologi dan Sekuens ITS rDNA Jamur Edibel Ektomikoriza Pelawan dan Struktur Ektomikorizanya
Abstrak: Ectomycorrhizae is the symbiosis of fungi and specific plant which is characterised by miselium mantled on root, the presence of Hartig net, and extracellular hyphae. Some ectomycorrhizal fungi are edible mushroom, and one of edible ectomyorrhizal fungi in Indonesia is pelawan mushroom. Morphological and molecular analysis of pelawan mushroom has been done. The spore shape is ovoid to ellipsoid with completely reticulate ornamentation. The characteristic of macroscopic and microscopic feature, especially spore shape and ornamentation, drew the description to genus Heimioporus which close to H. retisporus but different in its spore morphology and some cystidial features. The DNA isolated using CTAB method and PCR amplified with ITS1 and ITS 4 primers showed about 700 bp long. Molecular analysis based on ITS ribosomal DNA showed this mushroom was closely related to Strobilomyces retisporus, a basidionym of H. retisporus with similarity under 90%. However, the lack of similar ITS sequences of the same genus made it hard to decide the species judgment based on molecular approach. The ectomycorrhizal structure of root symbiont was also examined. The root has crème colour with monopodially branch type and white extra radical septated hyphae without clamp connection. The section of the root revealed the mantle with plectenchymatous and pseudoparenchymatous hyphae and para-epidermal Hartig net. This research revealed a new information about ectomycorrhizal symbiosis between Heimioporus sp. and Tristaniopsis merguensis.
Keyword: 

Judul: Analisis Keanekaragaman Isolat Pleurotus spp. Liar dan Domestik Berdasar Sifat Morfologi, Fisiologi dan Molekuler
Abstrak: Oyster mushroom (Pleurotus spp.) are edible mushroom with high diversity. Cultivated oyster isolates in Indonesia are from local isolates as well as from outside Indonesia. Report on their genetic diversity based on characteristic of morphological and physiological are still scare found in Indonesia, even analytic based on molecular characteristic is never report in Indonesia. This study was aimed to identify several kind of wild and domestic isolates of oyster mushrooms based on morphological, physiological, genetic, and molecular characteristic. The result indicated that there were two groups of isolates based on morphological characteristic of a fruiting body, A group and B group. A group was consisted ofHHB247 isolate (pink color) and nine isolates (white and brown color) grouped on B which then divided into two groups B1 and B2_ This B1 divided into two groups C1 and C2. C1 included only one isolate that was HHB215 isolate (brown color ) and C2 include one white color isolate (sp2) and one brown color isolate (sp6). B2 divided two groups D1 and D2, D1 included two white color isolates (sp3, sp5) and one brown color isolate (HHB328). D2 included three white color isolates (HHB327, sp4 and spl). Based on morphological characteristic the, ten of oyster mushroom isolates can not be in groups related to the color of fruiting bodies. The result indicated that there were two groups of isolates based on physiological characteristic, A group and B group. A group was consisted of HHB247 isolate (pink color) and nine isolates (white and brown color) grouped on B which then divided into two groups B1 and B2. B1 included only one isolate that was sp6 isolate (brown color). B2 divided two groups Cl and C2. Cl included two brown color isolates (HHB215, HHB328), C2 divided two groups Dl and D2. Dl include five white color isolates (spl, sp2, sp3, sp4, and sp5), D2 included only one isolate that was HHB327 isolate (white color). Based on physiological characteristic, ten of oyster mushroom isolates can be in groups related to the color. The frequency of mating between single spores of intra isolates (similar color of fruiting bodies) was highly (60% - 74%), but the frequency of mating between inter isolates was O %. Molecular analysis on Pleurotus spp. and Lentinus isolates was done using RAPD molecular marker with five primers (RP-2, RP-3, Rp-3, RP-4 and RP-6). The result indicated that there were two groups of isolates based on moleculer characteristic, A group and B group. A divided two groups Al and A2. Al included only one isolate that was HHB307 isolate ( the color was not determined), and A2 included six white color isolates (HHB327, Spl, Sp2, Sp3, Sp4, and Sp5) with 100% of similarity index. B divided two groups Bl and B2. Bl included three brown color isolates (HHB32S, HHB215 and sp6) with two last isolates had 100% of similarity index, and B2 included one...dst
Keyword: jamur tiram, RAPD, mating, analisis molekuler, spora tunggal

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