activity
20112026
most citedSymbolic Regression is NP-hard

29 citations · 45 across the 41 of their papers we have counts for

collaborators
Showing 2024Show all

7 papers · 1 filter

cs.DS2024

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…

cs.DS2024★ 1 cited

Elastic-Degenerate String Comparison

Esteban Gabory, Moses Njagi Mwaniki, Nadia Pisanti +4

An elastic-degenerate (ED) string is a sequence of sets containing strings in total whose cumulative length is . We call , , and the len…

cs.DS2024

Optimal prefix-suffix queries with applications

Solon P. Pissis

We revisit the classic border tree data structure [Gu, Farach, Beigel, SODA 1994] that answers the following prefix-suffix queries on a string of length over an integer alp…

cs.DS2024★ 1 cited

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…

cs.DS2024

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…

cs.DS2024★ 1 cited

Space-Efficient Indexes for Uncertain Strings

Esteban Gabory, Chang Liu, Grigorios Loukides +2

Strings in the real world are often encoded with some level of uncertainty. In the character-level uncertainty model, an uncertain string of length on an alphabet is a…

cs.DS2024

Approximate Circular Pattern Matching under Edit Distance

Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski +3

In the -Edit Circular Pattern Matching (-Edit CPM) problem, we are given a length- text , a length- pattern , and a positive integer threshold , and we are to…