Results 1 
3 of
3
Possibilistic channels for DNA word design
 In Proceedings of SMPS 2006
, 2006
"... Summary. We deal with DNA combinatorial code constructions, as found in the literature, taking the point of view of possibilistic information theory and possibilistic coding theory. The possibilistic framework allows one to tackle an intriguing informationtheoretic question: what is channel noise i ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Summary. We deal with DNA combinatorial code constructions, as found in the literature, taking the point of view of possibilistic information theory and possibilistic coding theory. The possibilistic framework allows one to tackle an intriguing informationtheoretic question: what is channel noise in molecular computation? We examine in detail two representative DNA string distances used for DNA code constructions and point out the merits of the first and the demerits of the second. The two string distances are based on the reverse Hamming distance as required to account for hybridisation of DNA strings.
Fuzzy codebooks for DNA Word Design
, 2006
"... We develop a formal framework to deal with code constructions in a fuzzy setting. Strings are modeled as fuzzy sets and an adequate concept of distance is defined. Moreover, we study fuzzy codebooks from the point of view of their minimum distance. This fuzzy framework is then used to model the DNA ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We develop a formal framework to deal with code constructions in a fuzzy setting. Strings are modeled as fuzzy sets and an adequate concept of distance is defined. Moreover, we study fuzzy codebooks from the point of view of their minimum distance. This fuzzy framework is then used to model the DNA word design problem, i.e. the construction of particular codes of DNA strings that are used in molecular computation.
Constraint satisfaction problems on DNA strings
 In Proceedings of 1th Int. Workshop on Constraintbased Methods in Bioinformatics , WCB
, 2005
"... Abstract. We explore the possibility of designing a constraintbased algorithm for constructing subsets of DNA words satisfying given constraints (the socalled DNA word design problem). In this direction, we use symbolic representation of sets of strings, and define a propagation algorithm on these ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We explore the possibility of designing a constraintbased algorithm for constructing subsets of DNA words satisfying given constraints (the socalled DNA word design problem). In this direction, we use symbolic representation of sets of strings, and define a propagation algorithm on these representations. Some preliminary results are presented, together with several open problems. Keywords: DNA word design, Code Construction, Constraint Programming. 1