'Fakultas Matematika dan Ilmu Pengetahuan Alam, Universitas Negeri Manado'
Abstract
Analisa filogenetik famili Dipterocarpaceae berdasarkan dna barcoding matK bertujuan untuk menganalisa hubungan kekerabatan dari beberapa spesies famili Dipterocarpaceae dan membandingkan hasil analisa berdasarkan nilai bootstrap dan waktu yang dibutuhkan untuk membangun pohon filogenetik menggunakan algoritma Neighbor-joining, Maximum Parsimony dan Maximum Likelihood. Adapun tahapan analisa terdiri dari pengumpulan data, pengubahan struktur nama sekuen, penjajaran sekuen, konstruksi pohon, evaluasi pohon dan analisa pohon. Hasil analisa kekerabatan dari ketiga metode (Neighbor-joining, Maximum parsimony dan Maximum likelihood) menunjukkan bahwa genus Dipterocarpus tidak membentuk monophyletic group dengan genus lain dari tribe Dipterocarpaceae. Pohon filogenetik dengan algoritma Maximum likelihood memiliki akurasi yang lebih tinggi dibandingkan algoritma Neighbor-joining maupun Maximum parsimony. Sedangkan waktu tercepat yang dibutuhkan untuk konstruksi pohon filogenetik secara berurutan yaitu algoritma Neighbor-joining, Maximum parsimony dan Maximum likelihood.Kata Kunci: Filogenetik, neighbor-joining, maximum parsimony, maximum likelihoodPhylogenetic analysis of family Dipterocarps based on dna barcoding matK aims to analyze the phylogenetic relationship of some species Dipterocarps and to compare the result of the analysis based on bootstrap values and the time required to construct the phylogenetic tree using the neighbor-joining, maximum parsimony and maximum likelihood algorithm. The analysis stage consists of collecting data, changing the structure of the sequences name, sequences alignment, tree building, tree evolution and analysis of tree. The result of the analysis of all three methods (neighbor-joining, maximum parsimony and maximum likelihood) showed that the genus Dipterocarpus do not a monophyletic group with other genera of the tribe Dipterocarpeae. Phylogenetic trees with maximum likelihood algorithm has a higher accuracy then neighbor-joining or maximum parsimony and the fastest time required for construction of phylogenetic trees sequentially is neighbor-joining, maximum parsimony and maximum likelihood.Keyword: Phylogenetic, neighbor-joining, maximum parsimony, maximum likelihoo
