Related Experiment Video
Updated: May 29, 2026

A Practical Guide to Phylogenetics for Nonexperts
Published on: February 5, 2014
Design, analysis, and implementation of a parallel tree search algorithm
S G Akl1, D T Barnard, R J Doran
1MEMBER, IEEE, Department of Computing and Information Science, Queen's University, Kingston, Ont., Canada.
Abstract:
The alpha-beta algorithm for searching decision trees is adapted to allow parallel activity in different parts of a tree during the search. The algorithm has been implemented in a procedural simulation language (GASP IV). The simulation environment provides the illusion of multiple software processes and multiple hardware processors. A number of preliminary experiments have been done to gather statistics on run time, nodes scored, and nodes visited. Results indicate that a substantial reduction in time of search occurs because of the use of parallelism. An analytic expression for the storage requirements of the algorithm is derived. The analysis provides an example of the classical tradeoff between time and storage.
Related Concept Videos
Survival Tree
Building a Survival Tree
Constructing a survival tree begins...
Trial and Error and Algorithm
Parallel Processing
Phylogenetic Trees
Design Example: Traverse Angle Computations
Parallel-Axis Theorem for an Area
For a flywheel approximated as a solid disc, consider an infinitesimal differential element with an arbitrary distance...

