Semi-dynamic compact index for short patterns and succinct van Emde Boas tree

DOI10.1007/978-3-319-19929-0_30zbMATH Open1432.68097OpenAlexW2399447931MaRDI QIDQ2942273FDOQ2942273

Authors: Yoshiaki Matsuoka, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda, Tomohiro I 

Publication date: 20 August 2015

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19929-0_30

Recommendations

• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• Dynamic dictionary matching and compressed suffix trees
• Compressed indexes for dynamic text collections
• Space efficient suffix trees
• Succinct indexes for strings, binary relations and multi-labeled trees

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15) Algorithms on strings (68W32)

Cites Work

• Log-logarithmic worst-case range queries are possible in space theta(N)
• Suffix Arrays: A New Method for On-Line String Searches
• On-line construction of suffix trees
• Optimal On-Line Search and Sublinear Time Update in String Matching
• Title not available (Why is that?)
• Indexing text using the Ziv--Lempel trie
• Dynamic extended suffix arrays

Cited In (1)

• Practical Performance of Space Efficient Data Structures for Longest Common Extensions.

This page was built for publication: Semi-dynamic compact index for short patterns and succinct van Emde Boas tree

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