Phylogenetic tree constructing algorithms fit for grid computing with SVD

TL;DR

This paper introduces new grid computing algorithms for phylogenetic tree construction using SVD of flattenings, ensuring statistical consistency with a fixed small number of rows.

Contribution

It develops novel algorithms based on SVD of flattenings that are optimized for grid computing and are statistically consistent for phylogenetic tree inference.

Findings

Algorithms are statistically consistent.

Suitable for grid computing environments.

Efficient with a small fixed number of rows.

Abstract

Erikkson 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.