𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Pattern matching in Huffman encoded texts

✍ Scribed by Shmuel T. Klein; Dana Shapira

Book ID
113663386
Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
320 KB
Volume
41
Category
Article
ISSN
0306-4573

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast pattern matching in indexed texts
Fast pattern matching in indexed texts
✍ Jean Senellart πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 309 KB

We present a simple and e cient algorithm for matching regular expression with texts, using full inverted text. It is based on the max-ow=min-cut algorithm, traditionaly employed to resolve linear problems. Our procedure constructs an optimal set of nodes for any automaton. They constitute the set o

On the Complexity of Pattern Matching fo
On the Complexity of Pattern Matching for Highly Compressed Two-Dimensional Texts
✍ Piotr Berman; Marek Karpinski; Lawrence L. Larmore; Wojciech Plandowski; Wojciec πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 293 KB

We consider the complexity of problems related to two-dimensional texts (2D-texts) described succinctly. In a succinct description, larger rectangular subtexts are defined in terms of smaller parts in a way similar to that

Pattern Matching in Hypertext
Pattern Matching in Hypertext
✍ Amihood Amir; Moshe Lewenstein; Noa Lewenstein πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 142 KB

The importance of hypertext has been steadily growing over the past decade. The Internet and other information systems use hypertext format, with data organized associatively rather than sequentially or relationally. A myriad of textual problems have been considered in the pattern matching field wit