Sciweavers

18 search results - page 2 / 4
» A Simple Fast Hybrid Pattern-Matching Algorithm
Sort
View
CPM
1999
Springer
107views Combinatorics» more  CPM 1999»
13 years 10 months ago
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
Gonzalo Navarro, Mathieu Raffinot
CIAC
2000
Springer
118views Algorithms» more  CIAC 2000»
13 years 10 months ago
Speeding Up Pattern Matching by Text Compression
Abstract. Byte pair encoding (BPE) is a simple universal text compression scheme. Decompression is very fast and requires small work space. Moreover, it is easy to decompress an ar...
Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Ma...
WEA
2007
Springer
125views Algorithms» more  WEA 2007»
13 years 11 months ago
Simple Compression Code Supporting Random Access and Fast String Matching
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
Kimmo Fredriksson, Fedor Nikitin
GECCO
2000
Springer
250views Optimization» more  GECCO 2000»
13 years 9 months ago
A Simple and Fast GA-SA hybrid Image Segmentation Algorithm
Image segmentation is an important process of image analysis. Most of the published approaches for image segmentation need to set appropriate parameter values to cope with the unc...
Shinn-Ying Ho, Kual-Zheng Lee
CSB
2005
IEEE
132views Bioinformatics» more  CSB 2005»
13 years 7 months ago
A Fast Shotgun Assembly Heuristic
Genome sequencing opened a new era in genetics allowing the study of genomes at the nucleotide level. However, the chosen method of sequencing produced large numbers of nucleotide...
Christopher Wilks, Sami Khuri