Sciweavers

170 search results - page 11 / 34
» Algorithms on Compressed Strings and Arrays
Sort
View
DATESO
2009
146views Database» more  DATESO 2009»
14 years 7 months ago
Compression of the Stream Array Data Structure
In recent years, many approaches to XML twig pattern query (TPQ) processing have been developed. Some algorithms are supported by a stream abstract data type. s an abstract data ty...
Radim Baca, Martin Pawlas
CEC
2008
IEEE
15 years 4 months ago
Solving one-billion-bit Noisy OneMax problem using Estimation Distribution Algorithm with Arithmetic Coding
— This paper presents an algorithm which combines Estimation Distribution Algorithm with a chromosome compression scheme to solve large scale Noisy OneMax problem. The search spa...
Worasait Suwannik, Prabhas Chongstitvatana
ALGORITHMICA
2010
164views more  ALGORITHMICA 2010»
14 years 9 months ago
Space Efficient Algorithms for the Burrows-Wheeler Backtransformation
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...
Ulrich Lauther, Tamás Lukovszki
ASAP
2008
IEEE
186views Hardware» more  ASAP 2008»
15 years 4 months ago
Accelerating Nussinov RNA secondary structure prediction with systolic arrays on FPGAs
RNA structure prediction, or folding, is a computeintensive task that lies at the core of several search applications in bioinformatics. We begin to address the need for high-thro...
Arpith C. Jacob, Jeremy Buhler, Roger D. Chamberla...
74
Voted
DAWAK
2007
Springer
15 years 1 months ago
An Efficient Algorithm for Identifying the Most Contributory Substring
Abstract. Detecting repeated portions of strings has important applications to many areas of study including data compression and computational biology. This paper defines and pres...
Ben Stephenson