Phylogenetic tree constructing algorithms fit for grid computing with SVD

Simple item page
dc.creatorKim, Young Rock
dc.creatorKwon, Oh-In
dc.creatorPaeng, Seong-Hun
dc.creatorPark, Chun-Jae
dc.date2006-11-04
dc.date.accessioned2026-07-07T07:33:57Z
dc.date.available2026-07-07T07:33:57Z
dc.descriptionErikkson showed that singular value decomposition(SVD) of flattenings determined a partition of a phylogenetic tree to be a split. In this paper, based on his work, we develop new statistically consistent algorithms fit for grid computing to construct a phylogenetic tree by computing SVD of flattenings with the small fixed number of rows.
dc.description14 pages, 7 figures
dc.identifierhttps://arxiv.org/abs/q-bio/0611015
dc.identifierhttp://arxiv.org/abs/q-bio/0611015
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119645
dc.subjectQuantitative Methods
dc.subjectPopulations and Evolution
dc.titlePhylogenetic tree constructing algorithms fit for grid computing with SVD
dc.typetext

Files

Collections

arXiv