Zobrazeno 1 - 10
of 12
pro vyhledávání: '"Pavel A. Vilenkin"'
Autor:
R. S. Sarbaev, David C. Torney, I. K. Ismagilov, Pavel A. Vilenkin, S. White, Anthony J. Macula, Arkadii G. D'yachkov
Publikováno v:
Problems of Information Transmission. 41: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 t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d41b7eb0006e74b0af028115f091d27a
https://doi.org/10.1007/s11122-006-0004-3
https://doi.org/10.1007/s11122-006-0004-3
Publikováno v:
Journal of Combinatorial Theory, Series A. 99:195-218
In 1964, Kautz and Singleton ( IEEE Trans. Inform. Theory 10 (1964), 363–377) introduced the superimposed code concept. A binary superimposed code of strength s is identified by the incidence matrix of a family of finite sets in which no set is cov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bc546caf6ca4d3b0d741a904df60c760
https://doi.org/10.1006/jcta.2002.3257
https://doi.org/10.1006/jcta.2002.3257
Publikováno v:
Bolyai Society Mathematical Studies ISBN: 9783540325734
We discuss three types of inclusion matrices (subset, subspace and sequence). We exhibit their disjunct properties and their applications to error-correcting nonadaptive group testing. Under some limited conditions, these structures are optimal for t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7741112ba9a2aae76bfe01b99316f9d4
https://doi.org/10.1007/978-3-540-32777-6_3
https://doi.org/10.1007/978-3-540-32777-6_3
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540462446
GTIT-C
GTIT-C
In this paper, we discuss a general notion of similarity function between two sequences which is based on their common subsequences. This notion arises in some applications of molecular biology [14]. We introduce the concept of similarity codes and s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::67e4ea9c0f2e60669e1629842cdc6797
https://doi.org/10.1007/11889342_52
https://doi.org/10.1007/11889342_52
Publikováno v:
ISIT
For q-ary n-sequences, we develop the concept of similarity functions that can be used (for q = 4) to model a thermodynamic similarity on DNA sequences. A similarity function is identified by the length of a longest common subsequence between two q-a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98825a62001f39a4f39cd56338679dca
https://doi.org/10.1109/isit.2005.1523339
https://doi.org/10.1109/isit.2005.1523339
Publikováno v:
Proceedings IEEE International Symposium on Information Theory.
We study a class of q-ary codes for the insertion-deletion distance function in the space of q-ary n-sequences. For q = 4, the codes arise from the potentialities of molecular biology. With the help of random coding arguments we obtain a lower bound
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::000f1120cd46e32d083568c242ca6d04
https://doi.org/10.1109/isit.2002.1023644
https://doi.org/10.1109/isit.2002.1023644
Publikováno v:
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
With the help of the local limit theorem we investigate the asymptotics of the Shannon and Renyi (1961) entropies for sums of independent identically distributed random variables.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::12a74d7eaa78924f348c0679bff719f3
https://doi.org/10.1109/isit.1998.708981
https://doi.org/10.1109/isit.1998.708981
Publikováno v:
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
This paper deals with (s,l)-cover-free families or superimposed (s,l)-codes. They generalize the concept of superimposed s-codes and have several applications for cryptography and group testing. We present a new asymptotic bound on the rate of optima
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f7139089de48f41edb54922cd46c5b0f
https://doi.org/10.1109/isit.2001.935980
https://doi.org/10.1109/isit.2001.935980
Publikováno v:
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).
We introduce three definitions of quaternary codes which are based on a biologically motivated measure of sequence similarity for quaternary n-sequences, extending Hamming similarity. The corresponding codes are used in bio-molecular experiments with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73b26f24d7d8ef8b0299b65f117bcb8d
https://doi.org/10.1109/isit.2000.866628
https://doi.org/10.1109/isit.2000.866628
Publikováno v:
mODa 6 — Advances in Model-Oriented Design and Analysis ISBN: 9783790814002
We discuss two non-standard models of nonadaptive combinatorial search which develop the conventional disjunct search model of Du and Hwang (1993) for a small number of defective elements contained in a finite ground set or a population. The first mo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eabcbf08d411ce4380f2896389901601
https://doi.org/10.1007/978-3-642-57576-1_8
https://doi.org/10.1007/978-3-642-57576-1_8