Results 251 to 260 of about 18,476 (288)

PROVGEN: A Privacy-Preserving Approach for Outcome Validation in Genomic Research. [PDF]

Proc Priv Enhanc Technol
Jiang Y, Ji T, Ayday E.
europepmc   +1 more source

HAMFAST: Fast Hamming Distance Computation [PDF]

2009 WRI World Congress on Computer Science and Information Engineering, 2009
Similarity is a vague concept which can be treated in a quantitative manner only using appropriate mathematical representation of the objects to compare and a metric on the space representation. In biology the mathematical representation of structure relies on strings taken from an alphabet of m symbols. Very often binary strings, m = 2, are used.
Francesco Pappalardo 0001, Cristiano Calonaci, Marzio Pennisi, Emilio Mastriani, Santo Motta   +4 more
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

On the Hamming distance properties of group codes

IEEE Transactions on Information Theory, 1992
Summary: Under certain mild conditions, the minimum Hamming distance \(D\) of an \((N,K,D)\) group code \(C\) over a non-Abelian group \(G\) is bounded by \(D\leq N-2K+2\) if \(K\leq N/2\), and is equal to 1 if \(K>N/2\).
G D Forney
exaly   +3 more sources

On computing the Hamming distance [PDF]

Acta Cybern., 2004
Summary: Methods for the fast computation of the Hamming distance developed for the case of a large number of pairs of words are presented and discussed in the paper. The connection of this subject to some questions about intersecting sets and Hadamard designs is also considered.
Gerzson Kéri, Ákos Kisvölcsey
openaire   +4 more sources

Inverse maximum flow problems under the weighted Hamming distance [PDF]

Journal of Combinatorial Optimization, 2006
In this paper, we consider inverse maximum flow problem under the weighted Hamming distance. Four models are studied: the problem under sum-type weighted Hamming distance; the problem under bottleneck-type weighted Hamming distance and two mixed types of
Longcheng Liu
exaly   +1 more source

Generalized Hamming Distance

Information Retrieval, 2002
Many problems in information retrieval and related fields depend on a reliable measure of the distance or similarity between objects that, most frequently, are represented as vectors. This paper considers vectors of bits. Such data structures implement entities as diverse as bitmaps that indicate the occurrences of terms and bitstrings indicating the ...
Abraham Bookstein, Vladimir A. Kulyukin, Timo Raita   +2 more
openaire   +1 more source

On private Hamming distance computation

The Journal of Supercomputing, 2013
Finding similarities between two datasets is an important task in many research areas, particularly those of data mining, information retrieval, cloud computing, and biometrics. However, maintaining data protection and privacy while enabling similarity measurements has become a priority for data owners in recent years.
Kok-Seng Wong, Myung Ho Kim
openaire   +1 more source

On minimal Hamming compatible distances

RAIRO - Theoretical Informatics and Applications, 2014
Summary: A Hamming compatible metric is an integer-valued metric on the words of a finite alphabet which agrees with the usual Hamming distance for words of equal length. We define a new Hamming compatible metric and show this metric is minimal in the class of all ``well-behaved'' Hamming compatible metrics.
Parsa Bakhtary, Othman Echi
openaire   +1 more source