Computer Science and Information Engineering, World Congress on (2009)

Los Angeles, California USA

Mar. 31, 2009 to Apr. 2, 2009

ISBN: 978-0-7695-3507-4

pp: 569-572

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.223

ABSTRACT

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. The size of the binary string depends on the complexity of the structure to represent, so the string can be quite long. The Hamming distance is the most used metric with binary strings. The computational effort required to compute the Hamming distance linearly depends on the size of the string. However even a linear effort case may be computational heavy if many computations are required. One of the fastest computational approach to evaluate Hamming distances relies on look-up tables. The computational performance, however, rapidly deteriorates with the size of binary string length, due to cache misses. We present a computational strategy and implementation which can handle huge number of Hamming distance evaluation between binary strings of arbitrary length keeping computational performance competitive.

INDEX TERMS

Hamming distance, immune system, computational modeling, algorithms, optimization

CITATION

Marzio Pennisi,
Emilio Mastriani,
Santo Motta,
Cristiano Calonaci,
Francesco Pappalardo,
"HAMFAST: Fast Hamming Distance Computation",

*Computer Science and Information Engineering, World Congress on*, vol. 01, no. , pp. 569-572, 2009, doi:10.1109/CSIE.2009.223SEARCH