On similarity codes

Citation
Ag. D'Yachkov et Dc. Torney, On similarity codes, IEEE INFO T, 46(4), 2000, pp. 1558-1564
Citations number
7
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE TRANSACTIONS ON INFORMATION THEORY
ISSN journal
00189448 → ACNP
Volume
46
Issue
4
Year of publication
2000
Pages
1558 - 1564
Database
ISI
SICI code
0018-9448(200007)46:4<1558:OSC>2.0.ZU;2-K
Abstract
We introduce a biologically motivated measure of sequence similarity for qu aternary N-sequences, extending Humming similarity. This measure is the sum over the length of the sequences of "alphabetic" similarities at all posit ions. Alphabetic similarities are defined, symmetrically on the Cartesian s quare of the alphabet. These similarities equal zero whenever the two eleme nts differ. In distinction to Hamming similarity, however, our alphabetic s imilarities Lake individual values whenever the two elements are identical. In this correspondence,ve derive lower and upper bounds on the rate of the corresponding quaternary nonlinear and linear codes called similarity code s and applied for DNA sequences.