Publication | Closed Access
Efficient parallel algorithm for multiple sequence alignments with regular expression constraints on graphics processing units
13
Citations
30
References
2014
Year
EngineeringMolecular BiologyParallel ImplementationRegular Expression ConstraintsGenomicsSequence AlignmentString-searching AlgorithmGpu-remusic V1.0Efficient Parallel AlgorithmParallel ComputingComputational GeometryComputational BiochemistrySequence AnalysisComputer ScienceFunctional GenomicsBioinformaticsConstrained Sequence AlignmentNatural SciencesComputational BiologyCombinatorial Pattern MatchingParallel ProgrammingMultiple Sequence AlignmentsSystems BiologySequence Assembly
Multiple sequence alignments with constraints has become an important problem in computational biology. The concept of constrained sequence alignment is proposed to incorporate the biologist’s domain knowledge into sequence alignments such that the user-specified residues/segments are aligned together in the alignment results. Over the past decade, a series of constrained multiple sequence alignment tools were proposed in the literature. RE-MuSiC is the newest tool with the regular expression constraints and useful for a wide range of biological applications. However, the computation time of REMuSiC is large for a large amount of sequences or long sequences and this problem limits the application usage. Therefore, in this paper, a tool, GPU-REMuSiC v1.0, is proposed to reduce the computation time of RE-MuSiC by using the graphics processing units with CUDA. GPU-REMuSiC v1.0 can achieve 29´ speedups for overall computation time by the experimental results.
| Year | Citations | |
|---|---|---|
Page 1
Page 1