On the relationship between histogram indexing and block-mass indexing

DOI10.1098/rsta.2013.0132zbMath1353.68311OpenAlexW1978006688WikidataQ45835891 ScholiaQ45835891MaRDI QIDQ2955626

Ely Porat, Amihood Amir, Ayelet Butman

Publication date: 13 January 2017

Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1098/rsta.2013.0132

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (5)

Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings ⋮ Efficient indexes for jumbled pattern matching with constant-sized alphabet ⋮ Generating a Gray code for prefix normal words in amortized polylogarithmic time per word ⋮ Unnamed Item ⋮ Bubble-flip -- a new generation algorithm for prefix normal words

Cites Work

• Sub-quadratic time and linear space data structures for permutation matching in binary strings
• Approximate string matching with stuck address bits
• Sorting permutations by block-interchanges
• On approximate jumbled pattern matching in strings
• Overlap matching.
• Approximate swapped matching.
• On-line construction of suffix trees
• A fast string searching algorithm
• Generalized String Matching
• A Space-Economical Suffix Tree Construction Algorithm
• Fast Pattern Matching in Strings
• Fast parallel and serial approximate string matching
• Text Indexing and Dictionary Matching with One Error
• Faster algorithms for string matching with k mismatches

This page was built for publication: On the relationship between histogram indexing and block-mass indexing