Abstract. To store and search genomic databases efficiently, researchers have recently started building compressed self-indexes based on straight-line programs ...

Sep 19, 2011 · To store and search genomic databases efficiently, researchers have recently started building compressed self-indexes based on grammars.

This paper shows how, given a balanced straight-line program for a string S[1..n] whose LZ77 parse consists of z phrases, one can add O(z log log z) words ...

To store and search genomic databases efficiently, researchers have recently started building compressed self-indexes based on grammars.

Researchers have recently started building compressed self-indexes based on context-free grammars (CFGs) and LZ77 [23], which better compress highly repetitive ...

Straight-line program, or grammar representation. Simply a context-free grammar with exactly one production per nonterminal. It is known that given a LZ77 ...

To store and search genomic databases efficiently, researchers have recently started building compressed self-indexes based on straight-line programs and ...

Jul 25, 2021 · Travis Gagie , Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich , Simon J. Puglisi: A Faster Grammar-Based Self-index. LATA 2012: 240-251.

A Faster Grammar-Based Self-index. https://doi.org/10.1007/978-3-642-28332-1_21 · Full text. Journal: Language and Automata Theory and Applications Lecture ...

Faster Grammar-based Self-index ; Number of pages, 12 ; Publisher, Springer-Verlag ; Publication date, 2012 ; Pages, 240-251 ; ISBN (Print), 978-3-642-28331-4.