583 search results - page 3 / 117 » New algorithms for efficient parallel string comparison |
AAIM
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
STRINGOLOGY
2008
13 years 8 months ago
2008
In this article we present two efficient variants of the BOM string matching algorithm which are more efficient and flexible than the original algorithm. We also present bit-parall...
CSB
2005
IEEE
14 years 1 months ago
2005
IEEE
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
HOTI
2008
IEEE
14 years 1 months ago
2008
IEEE
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
DNA sequence comparison is a computationally intensive problem, known widely since the competition for human DNA decryption. Database search for DNA sequence comparison is of grea...