<p>The tested algorithms are the original Clustal W 1.83, the MC64-ClustalWP2 for Tile64 and PC, and two parallel implementations for x86 systems (MT-ClustalW and ClustalW-MPI). In addition, the minimum gain ratio of the MC64-ClustalWP2 against all the other implementations is exposed for each set of sequences.</p
Sequence alignment is the problem of finding the optimal character-by-character correspondence betwe...
Abstract—We develop novel single-GPU parallelizations of the Smith-Waterman algorithm for pairwise s...
Since finding an optimal multiple sequences alignment is a NP-hard problem, various heuristic approa...
<p>The speedup is shown both for each relevant stage and for the full execution when aligning sets o...
We have developed the MC64-ClustalWP2 as a new implementation of the Clustal W algorithm, integratin...
We have developed the MC64-ClustalWP2 as a new implementation of the Clustal W algorithm, integratin...
<p>The executable algorithm is run in the host machine: the pairwise-alignments stage communicates w...
This activity with the project PRACE-2IP is aimed to investigate and improve the performance of mult...
The Constrained Multiple Sequence Alignment problem is to align a set of sequences subject to a give...
The Constrained Multiple Sequence Alignment problem is to align a set of sequences subject to a give...
This work is aimed to investigate and to improve the performance of multiple sequence alignment soft...
2009 International Conference on ReConFigurable Computing and FPGAs, ReConFig'09 --9 December 2009 t...
<p>Running time of aligning 1,000 simulated Illumina reads to human reference sequences of various l...
Sequence alignment is a fundamental instrument in Bioinformatics. In recent years, numerous proposal...
Sequence comparison with a ne gap costs is a problem that is readily parallelizable on simple single...
Sequence alignment is the problem of finding the optimal character-by-character correspondence betwe...
Abstract—We develop novel single-GPU parallelizations of the Smith-Waterman algorithm for pairwise s...
Since finding an optimal multiple sequences alignment is a NP-hard problem, various heuristic approa...
<p>The speedup is shown both for each relevant stage and for the full execution when aligning sets o...
We have developed the MC64-ClustalWP2 as a new implementation of the Clustal W algorithm, integratin...
We have developed the MC64-ClustalWP2 as a new implementation of the Clustal W algorithm, integratin...
<p>The executable algorithm is run in the host machine: the pairwise-alignments stage communicates w...
This activity with the project PRACE-2IP is aimed to investigate and improve the performance of mult...
The Constrained Multiple Sequence Alignment problem is to align a set of sequences subject to a give...
The Constrained Multiple Sequence Alignment problem is to align a set of sequences subject to a give...
This work is aimed to investigate and to improve the performance of multiple sequence alignment soft...
2009 International Conference on ReConFigurable Computing and FPGAs, ReConFig'09 --9 December 2009 t...
<p>Running time of aligning 1,000 simulated Illumina reads to human reference sequences of various l...
Sequence alignment is a fundamental instrument in Bioinformatics. In recent years, numerous proposal...
Sequence comparison with a ne gap costs is a problem that is readily parallelizable on simple single...
Sequence alignment is the problem of finding the optimal character-by-character correspondence betwe...
Abstract—We develop novel single-GPU parallelizations of the Smith-Waterman algorithm for pairwise s...
Since finding an optimal multiple sequences alignment is a NP-hard problem, various heuristic approa...