Indexing permutations for binary strings
From MaRDI portal
Publication:407548
DOI10.1016/j.ipl.2010.06.012zbMath1234.68479OpenAlexW1968531819MaRDI QIDQ407548
Tanaeem M. Moosa, M. Sohel Rahman
Publication date: 27 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.06.012
Combinatorics in computer science (68R05) Data structures (68P05) Computing methodologies for text processing; mathematical typography (68U15) Algorithms on strings (68W32)
Related Items (12)
Fast algorithms for abelian periods in words and greatest common divisor queries ⋮ Binary jumbled pattern matching on trees and tree-like structures ⋮ Sub-quadratic time and linear space data structures for permutation matching in binary strings ⋮ New algorithms for binary jumbled pattern matching ⋮ Binary jumbled string matching for highly run-length compressible texts ⋮ Algorithms for computing abelian periods of words ⋮ Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings ⋮ Efficient indexes for jumbled pattern matching with constant-sized alphabet ⋮ On approximate jumbled pattern matching in strings ⋮ On prefix normal words and prefix normal forms ⋮ Algorithms for Longest Common Abelian Factors ⋮ Orthogonal Range Searching for Text Indexing
Cites Work
This page was built for publication: Indexing permutations for binary strings