Succinct indexes for circular patterns

DOI10.1007/978-3-642-25591-5_69MaRDI QIDQ3104669zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Efficient algorithm for circular Burrows-Wheeler transform
• Indexing Circular Patterns
• pBWT: achieving succinct data structures for parameterized pattern matching and related problems
• A categorization theorem on suffix arrays with applications to space efficient text indexes
• Space-efficient construction algorithm for the circular suffix tree

Cited in

(13)

• Wheeler graphs: a framework for BWT-based data structures
• Computing the multi-string BWT and LCP array in external memory
• Lightweight merging of compressed indices based on BWT variants
• Efficient algorithm for circular Burrows-Wheeler transform
• Fast circular dictionary-matching algorithm
• Searching and indexing circular patterns
• Indexing Circular Patterns
• A new class of string transformations for compressed text indexing
• Constructing and indexing the bijective and extended Burrows-Wheeler transform
• Sorting circular suffixes in linear time
• Internal pattern matching in small space and applications
• Approximate circular pattern matching
• Improved circular dictionary matching

This page was built for publication: Succinct indexes for circular patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104669)