✦ LIBER ✦

Two-dimensional dictionary matching

✍ Scribed by Amihood Amir; Martin Farach

Book ID: 107766070
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 658 KB
Volume: 44
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90206-b

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two dimensional pattern matching

✍ R.S. Bird 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 374 KB

Dynamic dictionary matching

✍ Amihood Amir; Martin Farach; Zvi Galil; Raffaele Giancarlo; Kunsoo Park 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 818 KB

We consider the dynamic dictionary matching problem. We are given a set of pattern strings (the dictionary) that can change over time; that is, we can insert a new pattern into the dictionary or delete a pattern from it. Moreover, given a text string, we must be able to find all occurrences of any p

Fast two-dimensional pattern matching

✍ Ricardo Baeza-Yates; Mireille Régnier 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 561 KB

Real Two Dimensional Scaled Matching

✍ Amihood Amir; Ayelet Butman; Moshe Lewenstein; Ely Porat 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 499 KB

Faster Two Dimensional Scaled Matching

✍ Amihood Amir; Eran Chencinski 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 452 KB

Optimal Two-Dimensional Compressed Match

Optimal Two-Dimensional Compressed Matching

✍ Amihood Amir; Gary Benson; Martin Farach 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Recent proliferation of digitized data and the unprecedented growth in the volume of stored and transmitted data motivated the definition of the compressed matching paradigm. This is the problem of efficiently finding a pattern P in a compressed text T without the need to decompress. We present the