2 citations · 6 across the 11 of their papers we have counts for
5 papers · 2 filters
Subtree Mode and Applications
Jialong Zhou, Ben Bals, Matei Tinca +4
The mode of a collection of values (i.e., the most frequent value in the collection) is a key summary statistic. Finding the mode in a given range of an array of values is thus of…
Contextual Pattern Mining and Counting
Ling Li, Daniel Gibney, Sharma V. Thankachan +2
Given a string of length , a longer string of length , and two integers and , the context of in is the set of all string pairs , w…
Resilient Pattern Mining
Pengxin Bian, Panagiotis Charalampopoulos, Lorraine A. K. Ayad +3
Frequent pattern mining is a flagship problem in data mining. In its most basic form, it asks for the set of substrings of a given string of length that occur at least …
Indexing Strings with Utilities
Giulia Bernardini, Huiping Chen, Alessio Conte +5
Applications in domains ranging from bioinformatics to advertising feature strings that come with numerical scores (utilities). The utilities quantify the importance, interest, pro…
U-index: A Universal Indexing Framework for Matching Long Patterns
Lorraine A. K. Ayad, Gabriele Fici, Ragnar Groot Koerkamp +4
Text indexing is a fundamental and well-studied problem. Classic solutions either replace the original text with a compressed representation, e.g., the FM-index and its variants, o…