Binary jumbled pattern matching: suffix tree indexing

DOI10.1007/978-981-96-1093-8_40MaRDI QIDQ6955083zbMATH OpenFDO

Authors Luís Felipe Ignácio Cunha, Mario Medina

Publication date 23 July 2025

Full work available at URL https://doi.org/10.1007/978-981-96-1093-8_40

zbMATH Keywords

binary jumbled pattern matchingParikh setParikh vectorsprefix normal formstring indexingsuffix tree

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A Lower Bound for Jumbled Indexing
• Binary jumbled string matching for highly run-length compressible texts
• Clustered Integer 3SUM via Additive Combinatorics
• Efficient indexes for jumbled pattern matching with constant-sized alphabet
• Fast algorithms for single and multiple pattern Cartesian tree matching
• Indexing permutations for binary strings
• New algorithms for binary jumbled pattern matching
• On approximate jumbled pattern matching in strings
• On prefix normal words and prefix normal forms
• On-line construction of suffix trees
• String processing and information retrieval. 20th international symposium, SPIRE 2013, Jerusalem, Israel, October 7--9. 2013, Proceedings
• Sub-quadratic time and linear space data structures for permutation matching in binary strings

This page was built for publication: Binary jumbled pattern matching: suffix tree indexing

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