Hashing and indexing: succinct data structures and smoothed analysis

DOI10.1007/978-3-319-13075-0_13MaRDI QIDQ2942624zbMATH OpenOpenAlexFDO

Authors Alberto Policriti, Nicola Prezza

Publication date 11 September 2015

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

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

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• A Linear Size Index for Approximate Pattern Matching
• The \(k\)-mismatch problem revisited
• Lower bounds for text indexing with mismatches and differences
• scientific article; zbMATH DE number 2011852
• Fast index for approximate string matching

Cited in

(5)

• Fast string dictionary lookup with one error
• The self-indexed search algorithm: a bit-level approach to minimal perfect hashing
• Applications of hashing in algebraic manipulation (an annotated bibliography)
• Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
• Efficient tabling of structured data with enhanced hash-consing

This page was built for publication: Hashing and indexing: succinct data structures and smoothed analysis

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