Related Experiment Video
Updated: Mar 2, 2026

A Practical Guide to Phylogenetics for Nonexperts
Published on: February 5, 2014
Parallel implementation of D-Phylo algorithm for maximum likelihood clusters
Shamita Malik1, Dolly Sharma2, Sunil Kumar Khatri3
1Amity School of Engineering and Technology, Amity University, Noida, Uttar Pradesh, India. mailtoshamita07@gmail.com.
Abstract:
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.
More Related Videos
Related Concept Videos
Evolutionary Relationships through Genome Comparisons
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Phylogenetic Trees
Phylogeny
Multi-species Conserved Sequences
Although the genome of each species varies greatly from each other, a few sequences are highly conserved. Such conserved...
Applications of Molecular Taxonomy

