Results 11 to 20 of about 274,129 (290)
Sublinear Algorithms for Approximating String Compressibility [PDF]
Algorithmica, 2007 We raise the question of approximating the compressibility of a string with respect to a fixed compression scheme, in sublinear time. We study this question in detail for two popular lossless compression schemes: run-length encoding (RLE) and Lempel-Ziv (
Raskhodnikova, Sofya +3 more
core +10 more sources
Algorithms for anti-powers in strings [PDF]
Information Processing Letters, 2018 A string $S[1,n]$ is a power (or tandem repeat) of order $k$ and period $n/k$ if it can decomposed into $k$ consecutive equal-length blocks of letters. Powers and periods are fundamental to string processing, and algorithms for their efficient computation have wide application and are heavily studied. Recently, Fici et al. (Proc. ICALP 2016) defined an
Golnaz Badkobeh +2 more
openaire +3 more sources
Faster algorithm of string comparison [PDF]
Pattern Analysis & Applications, 2003 In many applications, it is necessary to determine the string similarity. Edit distance[WF74] approach is a classic method to determine Field Similarity. A well known dynamic programming algorithm [GUS97] is used to calculate edit distance with the time complexity O(nm).
Qi Xiao Yang +4 more
openaire +3 more sources
Combinatorial Algorithms for String Sanitization [PDF]
ACM Transactions on Knowledge Discovery from Data, 2020 String data are often disseminated to support applications such as location-based service provision or DNA sequence analysis. This dissemination, however, may expose sensitive patterns that model confidential knowledge (e.g., trips to mental health clinics from a string representing a user’s location history).
G. Bernardini +8 more
openaire +5 more sources
Lyndon Factorization Algorithms for Small Alphabets and Run-Length Encoded Strings
Algorithms, 2019 We present two modifications of Duval’s algorithm for computing the Lyndon factorization of a string. One of the algorithms has been designed for strings containing runs of the smallest character. It works best for small alphabets and it is able to
Sukhpal Singh Ghuman +2 more
doaj +1 more source
Combinatoric topological string theories and group theory algorithms
Journal of High Energy Physics, 2022 A number of finite algorithms for constructing representation theoretic data from group multiplications in a finite group G have recently been shown to be related to amplitudes for combinatoric topological strings (G-CTST) based on Dijkgraaf-Witten ...
Sanjaye Ramgoolam, Eric Sharpe
doaj +1 more source
Boosting Perturbation-Based Iterative Algorithms to Compute the Median String
IEEE Access, 2021 The most competitive heuristics for calculating the median string are those that use perturbation-based iterative algorithms. Given the complexity of this problem, which under many formulations is NP-hard, the computational cost involved in the exact ...
Pedro Mirabal +4 more
doaj +1 more source
Engineering Parallel String Sorting [PDF]
, 2014 We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and successful parallel sorting algorithms for atomic objects, we first propose ...
Bingmann, Timo +2 more
core +3 more sources
Repetitions in strings: Algorithms and combinatorics
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maxime Crochemore +2 more
openaire +4 more sources
APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING
Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska, 2017 We consider the application of multiple pattern matching (Multi AOSO on q-Grams) algorithm for approximate pattern matching. We propose the on-line approach which translates the problem from approximate pattern matching into a multiple pattern one ...
Robert Susik
doaj +1 more source