Search Results - "String algorithms"

Double-ended palindromic trees in linear time by Wang, Qisheng, Yang, Ming, Zhu, Xinrui

“…The palindromic tree (a.k.a. eertree) is a data structure that provides access to all palindromic substrings of a string. In this paper, we propose a dynamic…”
Get full text

Non-overlapping indexing in BWT-runs bounded space by Gibney, Daniel, MacNichol, Paul, Thankachan, Sharma V.

“…We revisit the non-overlapping indexing problem for an efficient repetition-aware solution. The problem is to index a text T[1..n], such that whenever a…”
Get full text

Internal shortest absent word queries in constant time and linear space by Badkobeh, Golnaz, Charalampopoulos, Panagiotis, Kosolobov, Dmitry, Pissis, Solon P.

“…Given a string T of length n over an alphabet Σ⊂{1,2,…,nO(1)} of size σ, we are to preprocess T so that given a range [i,j], we can return a representation of…”
Get full text

Faster space-efficient STR-IC-LCS computation by Yonemoto, Yuki, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo

“…One of the most fundamental method for comparing two given strings A and B is the longest common subsequence (LCS), where the task is to find (the length) of…”
Get full text

Finding top-k longest palindromes in substrings by Mitani, Kazuki, Mieno, Takuya, Seto, Kazuhisa, Horiyama, Takashi

“…Palindromes are strings that read the same forward and backward. Problems of computing palindromic structures in strings have been studied for many years with…”
Get full text

Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets by Fujishige, Yuta, Tsujimaru, Yuki, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki

“…The directed acyclic word graph (DAWG) of a string y of length n is the smallest (partial) DFA which recognizes all suffixes of y with only O(n) nodes and…”
Get full text

k-Universality of Regular Languages by Adamson, Duncan, Fleischmann, Pamela, Huch, Annika, Koß, Tore, Manea, Florin, Nowotka, Dirk

“…A subsequence of a word w is a word u such that u=w[i1]w[i2]…w[ik], for some set of indices 1≤i1<i2<…<ik≤|w|. A word w is k-subsequence universal over an…”
Get full text

Dynamic and Internal Longest Common Substring by Amir, Amihood, Charalampopoulos, Panagiotis, Pissis, Solon P., Radoszewski, Jakub

“…Given two strings S and T , each of length at most n , the longest common substring (LCS) problem is to find a longest substring common to S and T . This is a…”
Get full text

Palindromic trees for a sliding window and its applications by Mieno, Takuya, Watanabe, Kiichi, Nakashima, Yuto, Inenaga, Shunsuke, Bannai, Hideo, Takeda, Masayuki

“…•The first study of distinct palindromes in a sliding window.•Efficient algorithms to maintain all distinct palindromes in a sliding window.•Application for…”
Get full text

Hide and Mine in Strings: Hardness, Algorithms, and Experiments by Bernardini, Giulia, Conte, Alessio, Gourdel, Garance, Grossi, Roberto, Loukides, Grigorios, Pisanti, Nadia, Pissis, Solon P., Punzi, Giulia, Stougie, Leen, Sweering, Michelle

“…Data sanitization and frequent pattern mining are two well-studied topics in data mining. Data sanitization is the process of disguising (hiding) confidential…”
Get full text

All-pairs suffix/prefix in optimal time using Aho-Corasick space by Loukides, Grigorios, Pissis, Solon P.

“…The all-pairs suffix/prefix (APSP) problem is a classic problem in computer science with many applications in bioinformatics. Given a set {S1,…,Sk} of k…”
Get full text

Bidirectional String Anchors for Improved Text Indexing and Top- K Similarity Search by Loukides, Grigorios, Pissis, Solon P., Sweering, Michelle

“…The minimizers sampling mechanism is a popular mechanism for string sampling. However, minimizers sampling mechanisms lack good guarantees on the expected size…”
Get full text

Missing value replacement in strings and applications by Bernardini, Giulia, Liu, Chang, Loukides, Grigorios, Marchetti-Spaccamela, Alberto, Pissis, Solon P., Stougie, Leen, Sweering, Michelle

“…Missing values arise routinely in real-world sequential (string) datasets due to: (1) imprecise data measurements; (2) flexible sequence modeling, such as…”
Get full text

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems by Le Gall, François, Seddighin, Saeed

“…Longest common substring (LCS), longest palindrome substring (LPS), and Ulam distance (UL) are three fundamental string problems that can be classically solved…”
Get full text

Closest periodic vectors in Lp spaces by Amir, Amihood, Eisenberg, Estrella, Levy, Avivit, Lewenstein, Noa

“…The problem of finding the period of a vector V is central to many applications. Let V′ be a periodic vector closest to V under some metric. We seek this V′,…”
Get full text

A subquadratic algorithm for minimum palindromic factorization by Fici, Gabriele, Gagie, Travis, Kärkkäinen, Juha, Kempa, Dominik

“…We give an O(nlog⁡n)-time, O(n)-space algorithm for factoring a string into the minimum number of palindromic substrings. That is, given a string S[1..n], in…”
Get full text

Data Structures for Computing Unique Palindromes in Static and Non-Static Strings by Mieno, Takuya, Funakoshi, Mitsuru

“…A palindromic substring T [ i .. j ] of a string T is said to be a shortest unique palindromic substring (SUPS) in T for an interval [ p ,  q ] if T [ i .. j ]…”
Get full text

Longest common substrings with k mismatches by Flouri, Tomas, Giaquinta, Emanuele, Kobert, Kassian, Ukkonen, Esko

“…The longest common substring with k-mismatches problem is to find, given two strings S1 and S2, a longest substring A1 of S1 and A2 of S2 such that the Hamming…”
Get full text

Pattern Masking for Dictionary Matching: Theory and Practice by Charalampopoulos, Panagiotis, Chen, Huiping, Christen, Peter, Loukides, Grigorios, Pisanti, Nadia, Pissis, Solon P., Radoszewski, Jakub

“…Data masking is a common technique for sanitizing sensitive data maintained in database systems which is becoming increasingly important in various application…”
Get full text

Elastic-Degenerate String Matching with 1 Error or Mismatch by Bernardini, Giulia, Gabory, Esteban, Pissis, Solon P., Stougie, Leen, Sweering, Michelle, Zuba, Wiktor

“…An elastic-degenerate (ED) string is a sequence of n finite sets of strings of total length N , introduced to represent a set of related DNA sequences, also…”
Get full text