History

Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 1 21 41 | next | last

Result 1 to 20 of 55 total

On critical relative distance of DNA codes for additive stem similarity. (English)
Comput. Res. Repos. 2010, Article No. 1001.1278 (2010).
1
DNA codes for additive stem similarity. (English)
Probl. Inf. Transm. 45, No. 2, 124-144 (2009); translation from Probl. Peredachi Inf. 45, No. 2, 56-77 (2009).
2
DNA codes based on stem similarities between DNA sequences. (English)
Garzon, Max H. (ed.) et al., DNA computing. 13th international meeting on DNA computing, DNA13, Memphis, TN, USA, June 4‒8, 2007. Revised selected papers. Berlin: Springer (ISBN 978-3-540-77961-2/pbk). Lecture Notes in Computer Science 4848, 146-151 (2008).
3
Free energy gap and statistical thermodynamic fidelity of DNA codes (English)
Journal of Computational Biology 14, No. 8, 1088-1104 (2007).
4
DNA codes based on stem similarities between DNA sequences (English)
DNA, 146-151 (2007).
5
Remark on “On DNA codes”. (English)
Probl. Inf. Transm. 42, No. 2, 166 (2006); translation from Probl. Peredachi Inf. 42, No. 2, 109 (2006).
6
Reverse-complement similarity codes. (English)
Ahlswede, Rudolf (ed.) et al., General theory of information transfer and combinatorics. Berlin: Springer (ISBN 978-3-540-46244-6/pbk). Lecture Notes in Computer Science 4123, 814-830 (2006).
7
On application of the partition distance concept to a comparative analysis of psychological or sociological tests. (English)
Stochastic Anal. Appl. 24, No. 1, 61-78 (2006).
8
New t-gap insertion-deletion-like metrics for DNA hybridization thermodynamic modeling (English)
Journal of Computational Biology 13, No. 4, 866-881 (2006).
9
Reverse-complement similarity codes (English)
GTIT-C, 814-830 (2006).
10
Reverse-complement similarity codes. (English)
Ahlswede, Rudolf (ed.) et al., General theory of information transfer and combinatorics. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 21, 281-282 (2005).
11
On DNA codes. (English)
Probl. Inf. Transm. 41, No. 4, 349-367 (2005); translation from Probl. Peredachi Inf. 2005, No. 4, 57-77 (2005).
12
A weighted insertion-deletion stacked pair thermodynamic metric for DNA codes. (English)
Ferretti, Claudio (ed.) et al., DNA computing. 10th international workshop on DNA computing, DNA10, Milan, Italy, June 7‒10, 2004. Revised selected papers. Berlin: Springer (ISBN 3-540-26174-5/pbk). Lecture Notes in Computer Science 3384, 90-103 (2005).
13
Reverse-complement similarity codes (English)
Electronic Notes in Discrete Mathematics 21, 281-282 (2005).
14
A construction of pooling designs with some happy surprises (English)
Journal of Computational Biology 12, No. 8, 1129-1136 (2005).
15
A weighted insertion-deletion stacked pair thermodynamic metric for DNA codes (English)
DNA, 90-103 (2004).
16
Exordium for DNA codes. (English)
J. Comb. Optim. 7, No. 4, 369-379 (2003).
17
Families of finite sets in which no intersection of $\ell$ sets is covered by the union of $s$ others. (English)
J. Comb. Theory, Ser. A 99, No.2, 195-218 (2002).
Classification: E.4 Reviewer: Nikolai L.Manev (Sofia)
18
Optimal superimposed codes and designs for Renyi’s search model. (English)
J. Stat. Plann. Inference 100, No.2, 281-302 (2002).
19
Families of finite sets in which no intersection of sets is covered by the union of s others (English)
J. Comb. Theory, Ser. A 99, No. 2, 195-218 (2002).
20
first | previous | 1 21 41 | next | last

Result 1 to 20 of 55 total