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: Perancangan Primer Spesifik untuk Mendeteksi Dini Jamur Pangan Ektomikoriza Pelawan
Abstrak: Pelawan mushroom (Heimioporus sp.) is an edible ectomycorrhiza which has significant economical value. The fruiting bodies of the mushroom are firstly developed in the symbiosis system in the mature host plant. The existence of the mycelia in the rhizoplane of the host plant in seedling stage need to be detected to ensure successful colonization of targeted fungi in mature host plant. Therefore, specific primer is needed for early detection. In this experiment, five sequences of ITS rDNA of pelawan mushroom (JPA, JB, JPC, JPD, and JPE) were successfully obtained which size of 743-745 bp and their bases variation was below 3,3%. The five sequences however, had a significant variation when they were compared with other ITS rDNA sequences of pelawan mushroom collection of the Mycology Division and RCBB-IPB laboratory (JPPK, JPPM, and JPPX). Therefore, the primers were designed into two different groups. The first group was primers designed based on ITS rDNA sequences of fruiting body of JPA-JPE. They were PelAF1-Pel5.8SR1 (±230 bp), Pel5.8SF2-PelAR2 (±320 bp), and PelAF1-PelAR2 (±650 bp). The second group was primers designed based on ITS rDNA sequences of fruiting body of JPPK-JPPX. They were PelBF1-Pel5.8SR1 (±180 bp), Pel5.8SF2-PelBR2 (±260 bp), and PelBF1-PelBR2 (±560 bp). The specificity of the designed primers were tested against fungal DNA of Mortierella sp., Penicillium sp., Hypoxylon sp., Fusarium sp., Glomerella sp., Volvariella sp., and Ganoderma applanatum (IPBCC.10.658) as well as DNA from both groups of pelawan mushroom. The results indicated that primers PelAF1-PelAR2 was specific to the first group and primers PelBF1-PelBR2 was specific to the second group of pelawan mushroom, but the other primers could amplify all or some of the fungal DNA tested.
Keyword: ectomycorrhiza, edible pelawan mushroom, Heimioporus sp, ITS rDNA, specific primer

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