Search Results for "mpi"

...This tool will let the users to avoid the analysis of not necessary reads, reducing the time of subsequent procedures with the dataset (e.g., assemblies, mappings, etc.). The tool is implemented with MPI in order to exploit the parallel capabilities of multicore clusters. It is faster than multithreaded counterparts (end of 2015) for the same number of cores and, thanks to the message-passing technology, it can be executed on clusters. There also exists a MapReduce counterpart of ParDRe, called MarDRe (see the link above). ...

MPI-dot2dot is a parallel tool to accelerate the identification of Tandem Repeats on multisequence datasetes. This tool receives as input a multisequence file with FASTQ or FASTA formats. It uses MPI processes and OpenMP threads to exploit the compute capabilities of multicore clusters.

...This tool allows bioinformatics to avoid the analysis of not necessary reads, reducing the time of subsequent procedures with the dataset. MarDRe is the Big Data counterpart of ParDRe (link above), which employs HPC technologies (i.e., hybrid MPI/multithreading) to reduce runtime on multicore systems. Instead, MarDRe takes advantage of the MapReduce programming model to significantly improve ParDRe performance on distributed systems, especially on cloud-based infrastructures. Written in pure Java to maximize cross-platform compatibility, MarDRe is built upon the open-source Apache Hadoop project, the most popular distributed computing framework for Big Data processing.

ParDRR-MPI is a parallel tool to remove duplicate reads. Duplicate reads can be seen as identical or nearly identical sequences with some mismatches. This tool will let the users to avoid the analysis of not necessary reads, reducing the time of subsequent procedures with the dataset (e.g., assemblies, mappings, etc.). The tool is implemented with MPI in order to exploit the parallel capabilities of multicore clusters.

The first parallel Smith-Waterman algorithm exploiting Intel Xeon Phi clusters to accelerate the alignment of long DNA sequences. This algorithm is written in C++ (with a set of SIMD intrinsic extensions), OpenMP and MPI. The performance evaluation revealed that our algorithm achieves very stable performance, and yields a performance of up to 30.1 GCUPS on a single Xeon Phi and up to 111.4 GCUPS on four Xeon Phis sharing a host.

pmutualinformation (parallel mutual information) computes the pairwise Mutual Information for all pairs of genes from a potentially massive and heterogeneous dataset containing GEPs. GEPs can be part of different experiments collected from public repositories. pmutualinformation runs on MIMD systems and has been implemented in C using the MPI standard.

Hy3S uses advanced MPI parallelized hybrid stochastic simulation methods to quickly compute the dynamics of biochemical networks with thousands of species/reactions. Many features included (see Home Page). An easy-to-use GUI (Matlab req) is included.

DecGPU (Distributed Error correction on GPUs) is a parallel and distributed error correction algorithm for large-scale short read assembly. It is implemented using CUDA C++ and MPI, running on a GPU cluster.

Whole-genome scale multiple genome local alignment search program. Supports unlimited length gapped-seed patterns, parallelization through distributed hashing, and unique a TF-IDF based repeat filtering method.

GeneIndex is a parallel program using MPI. It finds frequencies and positions of all words of a certain length in a DNA sequence. Large genome will be an ideal target of GeneIndex.

A project to distributed phylogenies into a MPI Cluster.