Results 41 to 50 of about 147,630 (190)
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
Reconstruction of Trees from Jumbled and Weighted Subtrees [PDF]
, 2016 Let T be an edge-labeled graph, where the labels are from a finite alphabet Sigma. For a subtree U of T the Parikh vector of U is a vector of length |Sigma| which specifies the multiplicity of each label in U.
Bartha, Dénes +2 more
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
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
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
Fast $q$-gram Mining on SLP Compressed Strings
, 2011 We present simple and efficient algorithms for calculating $q$-gram frequencies on strings represented in compressed form, namely, as a straight line program (SLP). Given an SLP of size $n$ that represents string $T$, we present an $O(qn)$ time and space
Bannai, Hideo +3 more
core +1 more source
Quantum Analog-Digital Conversion [PDF]
, 2019 Many quantum algorithms, such as Harrow-Hassidim-Lloyd (HHL) algorithm, depend on oracles that efficiently encode classical data into a quantum state. The encoding of the data can be categorized into two types; analog-encoding where the data are stored ...
Fujii, Keisuke +2 more
core +1 more source
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
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
Competent genetic-evolutionary optimization of water distribution systems [PDF]
, 2001 A genetic algorithm has been applied to the optimal design and rehabilitation of a water distribution system. Many of the previous applications have been limited to small water distribution systems, where the computer time used for solving the problem ...
Simpson, A., Wu, Z.
core +1 more source