4 papers · 1 filter
Scalable Order-Preserving Pattern Mining
Ling Li, Wiktor Zuba, Grigorios Loukides +2
Time series are ubiquitous in domains ranging from medicine to marketing and finance. Frequent Pattern Mining (FPM) from a time series has thus received much attention. Recently, i…
Text Indexing for Long Patterns using Locally Consistent Anchors
Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis
In many real-world database systems, a large fraction of the data is represented by strings: sequences of letters over some alphabet. This is because strings can easily encode data…
Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast
Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis +1
Sparse suffix sorting is the problem of sorting suffixes of a string of length . Efficient sparse suffix sorting algorithms have existed for more than a decade. Despite…
Minimizing the Minimizers via Alphabet Reordering
Hilde Verbeek, Lorraine A. K. Ayad, Grigorios Loukides +1
Minimizers sampling is one of the most widely-used mechanisms for sampling strings [Roberts et al., Bioinformatics 2004]. Let be a string over a totally ordered…