Succinct Indexes for Circular Patterns

DOI10.1007/978-3-642-25591-5_69zbMath1350.68302OpenAlexW75501871MaRDI QIDQ3104669

Sharma V. Thankachan, Chen-Hua Lu, Wing-Kai Hon, Rahul Shah

Publication date: 16 December 2011

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_69

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Information storage and retrieval of data (68P20) Algorithms on strings (68W32)

Related Items (7)

Wheeler graphs: a framework for BWT-based data structures ⋮ A new class of string transformations for compressed text indexing ⋮ Constructing and indexing the bijective and extended Burrows-Wheeler transform ⋮ Fast circular dictionary-matching algorithm ⋮ Searching and Indexing Circular Patterns ⋮ Computing the multi-string BWT and LCP array in external memory ⋮ Lightweight merging of compressed indices based on BWT variants

This page was built for publication: Succinct Indexes for Circular Patterns