Traditional Fuzzy Automata are not sufficient to model complex real life applications such as biomedical systems where the inputs can be in terms of Fuzzy. Watson Crick Finite Automaton, which works on Double Stranded tapes was introduced a computational analyze DNA molecule for purpose. The concept Fuzziness and studied theory Automaton. thought an effective computing with problems having inco...

In this paper I discuss the discovery of the DNA structure by Francis Crick and James Watson, which has provoked a large historical literature but has yet not found entry into philosophical debates. I want to redress this imbalance. In contrast to the historical literature a strong emphasis will be placed upon analysing the roles played by theory, model and evidence and the relationship between...

To provide molecular-level insights into the spontaneous replication error and the mismatch discrimination mechanisms of human DNA polymerase β (polβ), we report four crystal structures of polβ complexed with dG•dTTP and dA•dCTP mismatches in the presence of Mg2+ or Mn2+. The Mg(2+)-bound ground-state structures show that the dA•dCTP-Mg2+ complex adopts an 'intermediate' protein conformation wh...

The pyr*pur.pyr type of nucleic acid triplex has a purine strand that is Hoogsteen-paired with a parallel pyrimidine strand (pyr*pur pair) and that is Watson-Crick-paired with an antiparallel pyrimidine strand (pur.pyr pair). In most cases, the Watson-Crick pair is more stable than the Hoogsteen pair, although stable formation of DNA Hoogsteen-paired duplexes has been reported. Using oligomer t...

A high affinity RNA aptamer (APT58, 58 nt long) against mammalian initiation factor 4A (eIF4A) requires nearly its entire nucleotide sequence for efficient binding. Since splitting either APT58 or eIF4A into two domains diminishes the affinity for each other, it is suggested that multiple interactions or a global interaction between the two molecules accounts for the high affinity. To understan...

a r t i c l e i n f o a b s t r a c t We study a generalization of the classical notions of bordered and unbordered words, motivated by biomolecular computing. DNA strands can be viewed as finite strings over the alphabet {A, G, C, T}, and are used in biomolecular 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 W...