Results 41 to 50 of about 70,442,116 (202)
PMS6MC: A Multicore Algorithm for Motif Discovery
Algorithms, 2013 We develop an efficient multicore algorithm, PMS6MC, for the (l; d)-motif discovery problem in which we are to find all strings of length l that appear in every string of a given set of strings with at most d mismatches. PMS6MC is based on PMS6, which is
Shibdas Bandyopadhyay +2 more
doaj +1 more source
Integrality, duality and finiteness in combinatoric topological strings
Journal of High Energy Physics, 2022 A remarkable result at the intersection of number theory and group theory states that the order of a finite group G (denoted |G|) is divisible by the dimension d R of any irreducible complex representation of G.
Robert de Mello Koch +3 more
doaj +1 more source
Fast equality test for straight-line compressed strings [PDF]
, 2011 The paper describes a simple and fast randomized test for equality of grammar-compressed strings. The thorough running time analysis is done by applying a logarithmic cost measure.
Schmidt-Schauß, Manfred +1 more
core
Algorithms on Grammar-Compressed Strings [PDF]
, 2011 Grammar based compression, where one replaces a long string by a small contextfree grammar that generates the string, is a simple and powerful paradigm that captures many of the popular compression schemes, including the Lempel-Ziv family, Run-Length Encoding, Byte-Pair Encoding, Sequitur and Re-Pair.
openaire +1 more source
ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS [PDF]
International Journal of Foundations of Computer Science, 2012 The Parikh vector p(s) of a string s over a finite ordered alphabet Σ = {a1, …, aσ} is defined as the vector of multiplicities of the characters, p(s) = (p1, …, pσ), where pi = |{j | sj = ai}|. Parikh vector q occurs in s if s has a substring t with p(t) = q. The problem of searching for a query q in a text s of length n can be solved simply and worst-
Peter Burcsi +3 more
openaire +4 more sources
Online Abelian Pattern Matching [PDF]
, 2008 Ejaz T, Rahmann S, Stoye J. Online Abelian Pattern Matching. Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik / Universität Bielefeld.
Ejaz, Tahir +2 more
core
Accelerated preprocessing in task of searching substrings in a string
Advanced Engineering Research, 2019 Introduction. A rapid development of the systems such as Yandex, Google, etc., has predetermined the relevance of the task of searching substrings in a string, and approaches to its solution are actively investigated. This task is used to create database
A. V. Mazurenko, N. V. Boldyrikhin
doaj +1 more source
Input–output maps are strongly biased towards simple outputs
Nature Communications, 2018 Algorithmic information theory measures the complexity of strings. Here the authors provide a practical bound on the probability that a randomly generated computer program produces a given output of a given complexity and apply this upper bound to RNA ...
Kamaludin Dingle +2 more
doaj +1 more source
Noisy Tree Data Structures and Quantum Applications
Mathematics, 2023 We suggest a new technique for developing noisy tree data structures. We call it a “walking tree”. As applications of the technique we present a noisy Self-Balanced Binary Search Tree (we use a Red–Black tree as an implementation) and a noisy segment ...
Kamil Khadiev +3 more
doaj +1 more source
Sublinear Algorithms for Approximating String Compressibility [PDF]
Algorithmica, 2007 To appear in the proceedings of RANDOM ...
Sofya Raskhodnikova +3 more
openaire +6 more sources