LCP Magic

Moshe Lewenstein

doi:10.1007/978-3-642-38905-4_2

LCP Magic

Moshe Lewenstein

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

LCP, the Longest Common Prefix, is ubiquitous in the realm of data structures for indexing. This surprisingly simple minute definition – magically – plays a big role in Pattern Matching. We will try to understand this ”magic” by examining a couple of interesting applications.

Original language	English
Title of host publication	Combinatorial Pattern Matching
Editors	Johannes Fischer, Peter Sanders
Place of Publication	Berlin, Germany
Publisher	Springer
Pages	11
Number of pages	1
DOIs	https://doi.org/10.1007/978-3-642-38905-4_2
State	Published - 2013

Access to Document

10.1007/978-3-642-38905-4_2

Cite this

@inbook{3645b9fd21984c2d8524635a72c60ccd,

title = "LCP Magic",

abstract = "LCP, the Longest Common Prefix, is ubiquitous in the realm of data structures for indexing. This surprisingly simple minute definition – magically – plays a big role in Pattern Matching. We will try to understand this ”magic” by examining a couple of interesting applications.",

author = "Moshe Lewenstein",

year = "2013",

doi = "10.1007/978-3-642-38905-4\_2",

language = "אנגלית",

pages = "11",

editor = "Fischer, \{Johannes \} and Sanders, \{Peter \}",

booktitle = "Combinatorial Pattern Matching",

publisher = "Springer",

}

TY - CHAP

T1 - LCP Magic

AU - Lewenstein, Moshe

PY - 2013

Y1 - 2013

N2 - LCP, the Longest Common Prefix, is ubiquitous in the realm of data structures for indexing. This surprisingly simple minute definition – magically – plays a big role in Pattern Matching. We will try to understand this ”magic” by examining a couple of interesting applications.

AB - LCP, the Longest Common Prefix, is ubiquitous in the realm of data structures for indexing. This surprisingly simple minute definition – magically – plays a big role in Pattern Matching. We will try to understand this ”magic” by examining a couple of interesting applications.

UR - https://www.mendeley.com/catalogue/543397ef-c0a8-3f61-a82b-1e8b7823b2cc/

U2 - 10.1007/978-3-642-38905-4_2

DO - 10.1007/978-3-642-38905-4_2

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.chapter???

SP - 11

BT - Combinatorial Pattern Matching

A2 - Fischer, Johannes

A2 - Sanders, Peter

PB - Springer

CY - Berlin, Germany

ER -

LCP Magic

Abstract

Access to Document

Other files and links

Fingerprint

Cite this