Abstract: Multiple Pairwise Sequence Alignments with the Needleman-Wunsch Algorithm on GPU.
Da LiMichela BecchiPublished in: SC Companion (2012)
Keyphrases
- pairwise
- sequence alignment
- preprocessing
- k means
- parallel implementation
- detection algorithm
- optimal solution
- computational complexity
- search space
- high accuracy
- real time
- dynamic programming
- worst case
- computational cost
- times faster
- optimization algorithm
- experimental evaluation
- cost function
- significant improvement
- objective function
- learning algorithm
- multiple sequence alignment
- parallel computation
- spectral clustering
- gpu implementation
- matching algorithm
- clustering method
- expectation maximization
- input data
- np hard
- neural network