Now showing items 1-6 of 6
Indexing and querying color sets of images
(Springer Varlag, 2016-09-27)
We aim to study the set of color sets of continuous regions of an image given as a matrix of m rows over n ≥ m columns where each element in the matrix is an integer from [1,σ] named a color . The set of distinct colors ...
Optimal Las Vegas reduction from one-way set reconciliation to error correction
(Springer Varlag, 2016-03-28)
Suppose we have two players A and C, where player A has a string s[0..u−1] and player C has a string t[0..u−1] and none of the two players knows the other's string. Assume that s and t are both over an integer alphabet ...
A framework for space-efficient read clustering in metagenomic samples
(BioMed Central, 2017-03-14)
Background: A metagenomic sample is a set of DNA fragments, randomly extracted from multiple cells in an environment, belonging to distinct, often unknown species. Unsupervised metagenomic clustering aims at partitioning ...
A Framework for Space-Efficient String Kernels
String kernels are typically used to compare genome-scale sequences whose length makes alignment impractical, yet their computation is based on data structures that are either space-inefficient, or incur large slowdowns. ...
Memory-Efficient and Ultra-Fast Network Lookup and Forwarding Using Othello Hashing
Abstract: Network algorithms always prefer low memory cost and fast packet processing speed. Forwarding information base (FIB), as a typical network processing component, requires a scalable and memory-efficient algorithm ...
Bidirectional Variable-Order de Bruijn Graphs
(World Scientific Publishing, 2018-12)
Compressed suffix trees and bidirectional FM-indexes can store a set of strings and support queries that let us explore the set of substrings they contain, adding and deleting characters on both the left and right, but ...