72 search results - page 8 / 15 » External Memory Algorithms for String Problems |
ICNP
2006
IEEE
14 years 1 months ago
2006
IEEE
— The phenomenal growth of the Internet in the last decade and society’s increasing dependence on it has brought along, a flood of security attacks on the networking and compu...
BMCBI
2008
13 years 7 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
ALGORITHMICA
2010
13 years 7 months ago
2010
The Burrows-Wheeler transformation is used for effective data compression, e.g., in the well known program bzip2. Compression and decompression are done in a block-wise fashion; la...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
—This paper presents the evolutionary programming with an ensemble of memories to deal with optimization problems in dynamic environments. The proposed algorithm modifies a recen...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...