Results 1 to 10 of about 18,990 (308)
Quantum Algorithms for Some Strings Problems Based on Quantum String Comparator [PDF]
Mathematics, 2022 We study algorithms for solving three problems on strings. These are sorting of n strings of length k, “the Most Frequent String Search Problem”, and “searching intersection of two sequences of strings”.
Kamil Khadiev +2 more
doaj +4 more sources
Repetitions in strings: Algorithms and combinatorics [PDF]
Theoretical Computer Science, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wojciech Rytter +2 more
exaly +7 more sources
Engineering rank queries on bit vectors and strings [PDF]
Algorithms for Molecular BiologyAdding rank support to strings over a fixed-sized alphabet has numerous applications. Prominent among those is the (bidirectional) FM-Index which is commonly utilized to index and analyze genomic data.
Simon Gene Gottlieb, Knut Reinert
doaj +2 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 (Giulia) +8 more
openaire +5 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
Finding a Maximum Clique in a Grounded 1-Bend String Graph
Journal of Graph Algorithms and Applications, 2022 A grounded 1-bend string graph is an intersection graph of a set of polygonal lines, each with one bend, such that the lines lie above a common horizontal line $\ell$ and have exactly one end point on $\ell$.
J. Mark Keil +3 more
doaj +1 more source
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
Position Automata for Kleene Algebra with Tests [PDF]
Scientific Annals of Computer Science, 2012 Kleene algebra with tests (KAT) is an equational system that combines Kleene and Boolean algebras. One can model basic programming constructs and assertions in KAT, which allowed for its application in compiler optimization, program transformation and ...
A. Silva
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
A Lossless Compression Method for Chat Messages Based on Huffman Coding and Dynamic Programming
Computers, 2021 There is always an increasing demand for data storage and transfer; therefore, data compression will always be a fundamental need. In this article, we propose a lossless data compression method focused on a particular kind of data, namely, chat messages,
Julián Moreno Cadavid +1 more
doaj +1 more source