54 search results - page 7 / 11 » Multiple Pattern Matching in LZW Compressed Text |
72
Voted
SPIRE
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
VLDB
1993
ACM
15 years 1 months ago
1993
ACM
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
JUCS
2000
14 years 9 months ago
2000
This article introduces the idea that information compression by multiple alignment, unification and search (ICMAUS) provides a framework within which natural language syntax may ...
ACL
2008
14 years 11 months ago
2008
This paper introduced the main features of the UAM CorpusTool, software for human and semi-automatic annotation of text and images. The demonstration will show how to set up an an...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...