Sciweavers

180 search results - page 2 / 36
» Approximate Searching on Compressed Text
Sort
View
DCC
2002
IEEE
14 years 5 months ago
Searching BWT Compressed Text with the Boyer-Moore Algorithm and Binary Search
Tim Bell, Matt Powell, Amar Mukherjee, Donald A. A...
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...
DCC
2008
IEEE
14 years 5 months ago
Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing
We introduce a new variant of the popular Burrows-Wheeler transform (BWT) called Geometric Burrows-Wheeler Transform (GBWT). Unlike BWT, which merely permutes the text, GBWT conve...
Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Jeffrey S...
IAJIT
2011
13 years 17 days ago
Multilayer model for Arabic text compression
: This article describes a multilayer model-based approach for text compression. It uses linguistic information to develop a multilayer decomposition model of the text in order to ...
Arafat Awajan
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