Acceleration of the Multiple-Try Metropolis algorithm using antithetic and stratified sampling

Acceleration of the Smith–Waterman algor

Acceleration of the Smith–Waterman algorithm using single and multiple graphics processors

✍ Ali Khajeh-Saeed; Stephen Poole; J. Blair Perot 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 705 KB

Finding regions of similarity between two very long data streams is a computationally intensive problem referred to as sequence alignment. Alignment algorithms must allow for imperfect sequence matching with different starting locations and some gaps and errors between the two data sequences. Perhap