Results 21 to 30 of about 148,669 (285)
Similarity Identification Based on Word Trigrams Using Exact String Matching Algorithms
Intensif: Jurnal Ilmiah Penelitian Teknologi dan Penerapan Sistem Informasi, 2022 Several studies regarding excellent exact string matching algorithms can be used to identify similarity, including the Rabin-Karp, Winnowing, and Horspool Boyer-Moore algorithms.
Abdul Fadlil +2 more
doaj +1 more source
Collapsing Superstring Conjecture [PDF]
, 2019 In the Shortest Common Superstring (SCS) problem, one is given a collection of strings, and needs to find a shortest string containing each of them as a substring. SCS admits 2 11/23-approximation in polynomial time (Mucha, SODA\u2713).
Golovnev, Alexander +4 more
core +2 more sources
Consistent Unsupervised Estimators for Anchored PCFGs
Transactions of the Association for Computational Linguistics, 2020 Learning probabilistic context-free grammars (PCFGs) from strings is a classic problem in computational linguistics since Horning ( 1969 ). Here we present an algorithm based on distributional learning that is a consistent estimator for a large class of ...
Clark, Alexander, Fijalkow, Nathanaël
doaj +1 more source
Quantum Algorithms for Classical Probability Distributions [PDF]
, 2019 We study quantum algorithms working on classical probability distributions. We formulate four different models for accessing a classical probability distribution on a quantum computer, which are derived from previous work on the topic, and study their ...
Belovs, Aleksandrs
core +2 more sources
Rotation of bits: a classical and quantum perspective
Journal of Electrical Systems and Information Technology, 2021 Bit rotation is an operation similar to shift except that the bits that fall off at one end are put back to the other end. In left rotation, the bits that fall off at left end are put back at right end.
Peter Nimbe +2 more
doaj +1 more source
Small Longest Tandem Scattered Subsequences
Scientific Annals of Computer Science, 2021 We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string.
Luıs M. S. Russo +1 more
doaj +1 more source
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words [PDF]
, 2012 Designing short DNA words is a problem of constructing a set (i.e., code) of n DNA strings (i.e., words) with the minimum length such that the Hamming distance between each pair of words is at least k and the n words satisfy a set of additional ...
Kao, Ming-Yang +3 more
core +2 more sources
Fast Arc-Annotated Subsequence Matching in Linear Space [PDF]
, 2010 An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings $P$ and $Q$ the arc-preserving subsequence problem is to determine if $P$ can be obtained ...
D. Harel +10 more
core +3 more sources
Computing Maximal Lyndon Substrings of a String
Algorithms, 2020 There are two reasons to have an efficient algorithm for identifying all right-maximal Lyndon substrings of a string: firstly, Bannai et al. introduced in 2015 a linear algorithm to compute all runs of a string that relies on knowing all right-maximal ...
Frantisek Franek, Michael Liut
doaj +1 more source
Symbolic Algorithms for Language Equivalence and Kleene Algebra with Tests [PDF]
, 2014 We first propose algorithms for checking language equivalence of finite automata over a large alphabet. We use symbolic automata, where the transition function is compactly represented using a (multi-terminal) binary decision diagrams (BDD). The key idea
Bouajjani A. +10 more
core +5 more sources