The Location of the Gene Regions Under Selective Pressure: Plato Algorithm Parallelization
The number of sequenced genes is dramatically increasing with that of international genomic projects. The gene sequence information proved to be helpful in predictions of protein structure, protein function and mutations targeted at improving the biological and biotechnological properties of proteins. Processing of the immense information stored in the databases demands high-throughput computational approaches. Here, we performed a parallelization of the algorithm for analysis of nucleotide substitutions in gene sequences from different organisms previously implemented in the PLATO program. The results demonstrated that the parallelization of the algorithm provides linear speedup of the PLATO program.
Keywordsgene evolution maximum likelihood algorithm parallel computing
Unable to display preview. Download preview PDF.
- 1.Grassly, N.C., Holmes, E.C.: A likelihood method for the detection of selection and recombination using nucleotide sequences. Molecular Biololy Evolution 14(3), 239–247 (1997)Google Scholar