Algorithms for jumbled pattern matching in strings
From MaRDI portal
Publication:2909200
DOI10.1142/S0129054112400175zbMATH Open1246.68273MaRDI QIDQ2909200FDOQ2909200
Authors: Péter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták 
Publication date: 30 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Analysis of algorithms (68W40) Searching and sorting (68P10) Combinatorics on words (68R15) Algorithms on strings (68W32) Computing methodologies for text processing; mathematical typography (68U15)
Cites Work
- Title not available (Why is that?)
- A fast string searching algorithm
- The Boyer–Moore–Galil String Searching Strategies Revisited
- Fast Pattern Matching in Strings
- Efficient text fingerprinting via Parikh mapping
- Scaled and permuted string matching
- Algorithmic complexity of protein identification: Combinatorics of weighted strings
Cited In (30)
- Bubble-flip -- a new generation algorithm for prefix normal words
- Weighted prefix normal words: mind the gap
- Binary jumbled string matching for highly run-length compressible texts
- Computing abelian complexity of binary uniform morphic words
- Abelian borders in binary words
- Circular sequence comparison with \(q\)-grams
- Permuted scaled matching
- Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
- Dyck Words, Lattice Paths, and Abelian Borders
- Sub-quadratic time and linear space data structures for permutation matching in binary strings
- On prefix normal words and prefix normal forms
- On infinite prefix normal words
- Fast algorithms for single and multiple pattern Cartesian tree matching
- On approximate jumbled pattern matching in strings
- Fast algorithms for abelian periods in words and greatest common divisor queries
- Finding patterns and periods in Cartesian tree matching
- Algorithms for computing abelian periods of words
- Cartesian Tree Matching and Indexing
- On hardness of jumbled indexing
- Binary jumbled pattern matching on trees and tree-like structures
- Subquadratic-time algorithms for abelian stringology problems
- Title not available (Why is that?)
- Binary jumbled pattern matching on trees and tree-like structures
- Algorithms for jumbled indexing, jumbled border and jumbled square on run-length encoded strings
- Fast Cartesian tree matching
- Improved online algorithms for jumbled matching
- Algorithms for String Pattern Discovery
- Dyck words, lattice paths, and abelian borders
- The graph motif problem parameterized by the structure of the input graph
- Efficient indexes for jumbled pattern matching with constant-sized alphabet
This page was built for publication: Algorithms for jumbled pattern matching in strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909200)
