相关论文: Computing q-gram Frequencies on Collage Systems

Discrete Cosine Transform (DCT) is very important in image compression. Classical 1-D DCT and 2-D DCT has time complexity O(NlogN) and O(N²logN) respectively. This paper presents a quantum DCT iteration, and constructs a quantum 1-D…

In the one-way model of quantum computing, quantum algorithms are implemented using only measurements on an entangled initial state. Much of the hard work is done up-front when creating this universal resource, known as a cluster state, on…

Most of the attention in statistical compression is given to the space used by the compressed sequence, a problem completely solved with optimal prefix codes. However, in many applications, the storage space used to represent the prefix…

We present a new graph compressor that works by recursively detecting repeated substructures and representing them through grammar rules. We show that for a large number of graphs the compressor obtains smaller representations than other…

Huffman Compression, also known as Huffman Coding, is one of many compression techniques in use today. The two important features of Huffman coding are instantaneousness that is the codes can be interpreted as soon as they are received and…

The order-preserving model (op-model, in short) was introduced quite recently but has already attracted significant attention because of its applications in data analysis. We introduce several types of periods in this setting (op-periods).…

Methods exhibiting linear scaling with respect to the size of the system, so called O(N) methods, are an essential tool for the calculation of the electronic structure of large systems containing many atoms. They are based on algorithms…

Repeat finding in strings has important applications in subfields such as computational biology. Surprisingly, all prior work on repeat finding did not consider the constraint on the locality of repeats. In this paper, we propose and study…

Like [1], we present an algorithm to compute the simulation of a query pattern in a graph of labeled nodes and unlabeled edges. However, our algorithm works on a compressed graph grammar, instead of on the original graph. The speed-up of…

One of the most scalable methods for continuous-variable quantum computing is to encode quantum information in the quantum optical frequency comb generated by an optical parametric oscillator (OPO). The scalability is limited by the…

We propose smooth $q$-gram, the first variant of $q$-gram that captures $q$-gram pair within a small edit distance. We apply smooth $q$-gram to the problem of detecting overlapping pairs of error-prone reads produced by single molecule real…

Computing the diameter, and more generally, all eccentricities of an undirected graph is an important problem in algorithmic graph theory and the challenge is to identify graph classes for which their computation can be achieved in…

Real-world data often comes in compressed form. Analyzing compressed data directly (without decompressing it) can save space and time by orders of magnitude. In this work, we focus on fundamental sequence comparison problems and try to…

We propose an efficient quantum state tomography method inspired by compressed sensing and threshold quantum state tomography that can drastically reduce the number of measurement settings to reconstruct the density matrix of an $N$-qudit…

In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a base-compressor C gets a compressed output that is shorter than applying C over the entire T at once.…

Shared entanglement can significantly amplify classical correlations between systems interacting over a limited quantum channel. A natural avenue is to use entanglement of the same dimension as the channel because this allows for unitary…

The convolution between a text string $S$ of length $N$ and a pattern string $P$ of length $m$ can be computed in $O(N \log m)$ time by FFT. It is known that various types of approximate string matching problems are reducible to…

It's the key research topic of signal processing that recognizing genuine targets real time from the disturbed signal which has giant amount of data. A quantum algorithm for pattern recognition of classical signal which has time complexity…

The worst-case fastest known algorithm for the Set Cover problem on universes with $n$ elements still essentially is the simple $O^*(2^n)$-time dynamic programming algorithm, and no non-trivial consequences of an $O^*(1.01^n)$-time…

In this paper we describe compressed indexes that support pattern matching queries for strings with wildcards. For a constant size alphabet our data structure uses $O(n\log^{\varepsilon}n)$ bits for any $\varepsilon>0$ and reports all…