Header menu link for other important links
Parallel implementation of D-Phylo algorithm for maximum likelihood clusters
Malik S., , Khatri S.K.
Published in Institution of Engineering and Technology
PMID: 28476995
Volume: 11
Issue: 2
Pages: 134 - 142
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 × 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. © The Institution of Engineering and Technology 2016.
About the journal
Published in Institution of Engineering and Technology
Open Access
Impact factor