.png){kind=icon}
Return
Parallel implementation of D-Phylo algorithm for maximum likelihood clusters
.png){kind=icon}
OA
AI
DOI：10.1049/iet-nbt.2016.0005.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This study explains a newly developed parallel algorithm for phylogenetic analysis of DNA sequences. The newly designed D-Phylo is a more advanced algorithm for phylogenetic analysis using maximum likelihood approach. The D-Phylo while misusing the seeking capacity of k-means keeps away from its real constraint of getting stuck at privately conserved motifs. The authors have tested the behaviour of D-Phylo on Amazon Linux Amazon Machine Image(Hardware Virtual Machine) i2.4xlarge, six central processing unit, 122 GiB memory, 8 x 800 Solid-state drive Elastic Block Store volume, high network performance up to 15 processors for several real-life datasets. Distributing the clusters evenly on all the processors provides us the capacity to accomplish a near direct speed if there should arise an occurrence of huge number of processors.
Keywords:
PHYLOGENETIC ANALYSIS
EVOLUTIONARY TREES
SYSTEMATIC BIASES
SELECTION
MODELS
CONSTRUCTION
CHARACTERS
TOOL
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.9
Papers:
1.1K
Citations:
3.0K
Organization
Cited Papers
ShareSaveShareSave
ShareSaveA Method for Inferring the Rate of Evolution of Homologous Characters that Can Potentially Improve Phylogenetic Inference, Resolve Deep Divergence and Correct Systematic Biases.png)
SYSTEMATIC BIOLOGYOAAI
SYSTEMATIC BIOLOGYIF5.7
OAAIShareSaveShareSave
View more