Using the algebra of hypergraph for reconstruction phylogenetic trees
Küçük Resim Yok
Tarih
2009
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Maltepe Üniversitesi
Erişim Hakkı
CC0 1.0 Universal
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Özet
In this paper, we will construct phylogenetic trees by using the algebra of hypergraph through Neighbor Joining Algorithm. Directed hypergraph can represent metabolic networks M(X,), where X is the set of metabolites and is the set of chemistry reactions. Metabolic network datas are obtained from citric-acid cycle of microorganism of 3 classes, which are 4 Archea, 11 Bacteria and 1 Eukaryote. Moreover, the result will be compared to the phylogenetic tree based on nucleotide sequences of 16s rRNA Gene of the same microorganisms.
Açıklama
Anahtar Kelimeler
Phylogenetic tree, Algebra of hypergraph, Neighbor joining algorithm, Metabolic networks, Citric-acid cycle, Nucleotide sequence of 16s rRNA Gene
Kaynak
International Conference of Mathematical Sciences
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Astuti, M., Dr. Irawati, Muchtadi-Alamsyah, I., Muchlis, A., Muliana, A. A. ve Halim, A. (2009). Using the algebra of hypergraph for reconstruction phylogenetic trees. Maltepe Üniversitesi. s. 285.
