On DNA Codes

@article{Dyachkov2005OnDC,
  title={On DNA Codes},
  author={Arkadii G. D'yachkov and Pavel A. Vilenkin and I. K. Ismagilov and R. S. Sarbaev and Anthony J. Macula and David C. Torney and Scott White},
  journal={Probl. Inf. Transm.},
  year={2005},
  volume={41},
  pages={349-367}
}
We develop and study the concept of similarity functions for q-ary sequences. For the case q = 4, these functions can be used for a mathematical model of the DNA duplex energy [1,2], which has a number of applications in molecular biology. Based on these similarity functions, we define a concept of DNA codes [1]. We give brief proofs for some of our unpublished results [3] connected with the well-known deletion similarity function [4–6]. This function is the length of the longest common… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 13 REFERENCES

Bounds for Deletion–Insertion Correcting Codes, in Proc

  • V. I. Levenshtein
  • IEEE Int. Symp. on Information Theory, Lausanne…
  • 2002
1 Excerpt

Asymptotic Problems of Combinatorial Coding Theory and Information Theory, Cand

  • P. A. Vilenkin
  • Sci. (Phys.-Math.) Dissertation, Moscow: Moscow…
  • 2000
1 Excerpt

Similar Papers

Loading similar papers…