research
∙
09/03/2023
Longest Common Substring and Longest Palindromic Substring in 𝒪̃(√(n)) Time
The Longest Common Substring (LCS) and Longest Palindromic Substring (LP...
share
research
∙
08/22/2023
Quantum Circuits for Fixed Substring Matching Problems
Quantum computation represents a computational paradigm whose distinctiv...
research
∙
03/31/2023
The Many Qualities of a New Directly Accessible Compression Scheme
We present a new variable-length computation-friendly encoding scheme, n...
research
∙
01/03/2021
Text Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations
In this paper we investigate the approximate string matching problem whe...
research
∙
11/05/2019
Fast Multiple Pattern Cartesian Tree Matching
Cartesian tree matching is the problem of finding all substrings in a gi...
research
∙
08/16/2019
Efficient Online String Matching Based on Characters Distance Text Sampling
Searching for all occurrences of a pattern in a text is a fundamental pr...
research
∙
08/14/2019
Fast Cartesian Tree Matching
Cartesian tree matching is the problem of finding all substrings of a gi...
research
∙
12/02/2018
Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations
Unbalanced translocations are among the most frequent chromosomal altera...
research
∙
03/07/2018
Flexible and Efficient Algorithms for Abelian Matching in Strings
The abelian pattern matching problem consists in finding all substrings ...
research
∙
07/01/2015
