Results 41 to 50 of about 148,669 (285)
The number of bit comparisons used by Quicksort: an average-case analysis
, 2012 The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and so count the number of bit comparisons.
Fill, James Allen, Svante Janson
core +6 more sources
Lempel-Ziv Factorization May Be Harder Than Computing All Runs [PDF]
, 2014 The complexity of computing the Lempel-Ziv factorization and the set of all runs (= maximal repetitions) is studied in the decision tree model of computation over ordered alphabet.
Kosolobov, Dmitry
core +3 more sources
Indeterminate string inference algorithms
Journal of Discrete Algorithms, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sumaiya Nazeen +2 more
openaire +2 more sources
The photon propagator in compact QED_{2+1}: the effect of wrapping Dirac strings
, 2003 We discuss the influence of closed Dirac strings on the photon propagator in the Landau gauge emerging from a study of the compact U(1) gauge model in 2+1 dimensions. This gauge also minimizes the total length of the Dirac strings.
A. Schiller +30 more
core +1 more source
Strongly universal string hashing is fast [PDF]
, 2014 We present fast strongly universal string hashing families: they can process data at a rate of 0.2 CPU cycle per byte. Maybe surprisingly, we find that these families---though they require a large buffer of random numbers---are often faster than popular ...
Kaser, Owen, Lemire, Daniel
core +2 more sources
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
Handling Massive N-Gram Datasets Efficiently [PDF]
, 2018 This paper deals with the two fundamental problems concerning the handling of large n-gram language models: indexing, that is compressing the n-gram strings and associated satellite data without compromising their retrieval speed; and estimation, that is
Pibiri, Giulio Ermanno +1 more
core +3 more sources
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
Molecular Oncology, EarlyView.EXOSC10, an essential nuclear RNA exosome‐associated 3′‐5′ exoribonuclease, is inhibited by the anticancer drug 5‐fluorouracil (5‐FU), and EXOSC10 depletion increases 5‐FU sensitivity. The colon‐cancer variant EXOSC10S402T, located in a proteolysis motif, is stable and nuclear but nonfunctional in vivo.
Radhika Sain +10 more
wiley +1 more source
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