Suchergebnisse - "String algorithms"

Parallel Implementation of Median String Algorithms von Mirabal, Pedro, Lincolao-Venegas, Ignacio, Castillo-Sanhueza, Mario, Abreu, Jose

“… Among the different heuristics proposed to solve the median string problem, only a few algorithms achieve bounded approximations to the theoretical median …”
Volltext

Tube-Based Taut String Algorithms for Total Variation Regularization von Makovetskii, Artyom, Voronin, Sergei, Kober, Vitaly, Voronin, Aleksei

“… ”. We propose three tube-based taut string algorithms for total variation regularization. Different weight functionals can be used in the 1D TV regularization that lead to different types of tubes …”
Volltext

New Frontiers in String Algorithms and Nearest Neighbour Search von Shekel Nosatzki, Negev

“… This thesis revolves arounds two main frameworks of problems: (i) String Problems such as the Longest Increasing Subsequence (LIS), Longest Common Subsequence …”
Volltext

Double-ended palindromic trees in linear time von 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 …”
Volltext

Non-overlapping indexing in BWT-runs bounded space von 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 …”
Volltext

String Algorithms von Stephens, Rod

Volltext

Internal shortest absent word queries in constant time and linear space von 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 …”
Volltext

Faster space-efficient STR-IC-LCS computation von 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 …”
Volltext

Finding top-k longest palindromes in substrings von 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 …”
Volltext

Efficient String Algorithms for Data Security and Privacy von Ajala, Oluwole

“… Uncertainties in data propagation are magnified across all stages in data science proliferation. It is therefore essential, that these uncertainties are …”
Volltext

Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets von 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 …”
Volltext

k-Universality of Regular Languages von 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 …”
Volltext

Dynamic and Internal Longest Common Substring von 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 …”
Volltext

Palindromic trees for a sliding window and its applications von 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 …”
Volltext

Hide and Mine in Strings: Hardness, Algorithms, and Experiments von 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 …”
Volltext

All-pairs suffix/prefix in optimal time using Aho-Corasick space von 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 …”
Volltext

Bidirectional String Anchors for Improved Text Indexing and Top- K Similarity Search von 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 …”
Volltext

Missing value replacement in strings and applications von 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 …”
Volltext

Parallel and Scalable Combinatorial String Algorithms on Distributed Memory Systems von Flick, Patrick

“… Methods for processing and analyzing DNA and genomic data are built upon combinatorial graph and string algorithms …”
Volltext

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems von 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 …”
Volltext