Kalpana Mahalingam

Learn More
For an involution θ : Σ * → Σ * over a finite alphabet Σ we consider involution codes: θ-infix, θ-comma-free, θ-k-codes and θ-subword-k-codes. These codes arise from questions on DNA strand design. We investigate conditions under which both X and X + are same type of involution codes. General methods for generating such involution codes are given. The(More)
One of the main research topics in DNA computing is associated with the design of information encoding single or double stranded DNA strands that are " suitable " for computation. Double stranded or partially double stranded DNA occurs as a result of binding between complementary DNA single strands (A is complementary to T and C is complementary to G). This(More)
The study of hairpin-free words has been initiated in the context of DNA computing. DNA strands that, theoretically speaking, are finite strings over the alphabet {A, G, C, T} are used in DNA computing to encode information. Due to the fact that A is complementary to T and G to C, DNA single strands that are complementary can bind to each other or to(More)
DNA strands that, mathematically speaking, are finite strings over the alphabet {A, G, C, T } are used in DNA computing to encode information. Due to the fact that A is Watson-Crick complementary to T and G to C, DNA single strands that are Watson-Crick complementary can bind to each other or to themselves in either intended or unintended ways. One of the(More)