research
∙
08/11/2023
Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching
A parameterized string (p-string) is a string over an alphabet (Σ_s∪Σ_p)...
share
research
∙
06/19/2023
Efficient Parameterized Pattern Matching in Sublinear Space
The parameterized matching problem is a variant of string matching, whic...
research
∙
01/11/2023
Linear Time Online Algorithms for Constructing Linear-size Suffix Trie
The suffix trees are fundamental data structures for various kinds of st...
research
∙
09/26/2022
Inferring strings from position heaps in linear time
Position heaps are index structures of text strings used for the exact s...
research
∙
06/30/2022
Computing the Parameterized Burrows–Wheeler Transform Online
Parameterized strings are a generalization of strings in that their char...
research
∙
02/27/2022
Parallel algorithm for pattern matching problems under substring consistent equivalence relations
Given a text and a pattern over an alphabet, the pattern matching proble...
research
∙
04/27/2020
In-Place Bijective Burrows-Wheeler Transforms
One of the most well-known variants of the Burrows-Wheeler transform (BW...
research
∙
03/18/2020
Grammar compression with probabilistic context-free grammar
We propose a new approach for universal lossless text compression, based...
research
∙
02/19/2020
Fast and linear-time string matching algorithms based on the distances of q-gram occurrences
Given a text T of length n and a pattern P of length m, the string match...
research
∙
02/17/2020
DAWGs for parameterized matching: online construction and related indexing structures
Two strings x and y over Σ∪Πof equal length are said to parameterized m...
research
∙
02/17/2020
Computing Covers under Substring Consistent Equivalence Relations
Covers are a kind of quasiperiodicity in strings. A string C is a cover ...
research
∙
09/17/2019
Generalized Dictionary Matching under Substring Consistent Equivalence Relations
Given a set of patterns called a dictionary and a text, the dictionary m...
research
∙
02/01/2019
Linear-size Suffix Tries for Parameterized Strings
In this paper, we propose a new indexing structure for parameterized str...
research
∙
01/29/2019
Online Algorithms for Constructing Linear-size Suffix Trie
The suffix trees are fundamental data structures for various kinds of st...
research
∙
07/27/2018
Enumerating Cryptarithms Using Deterministic Finite Automata
A cryptarithm is a mathematical puzzle where given an arithmetic equatio...
research
∙
06/26/2018
