Searching for occurrences of string patterns is a common problem in many applications. Various good solutions have been presented for string matching. The most efficient solutions in practice are based on the Boyer–Moore algorithm.1 A typical question in molecular biology is whether a given sequence has appeared elsewhere. In the following, we will concentrate on searching for exact occurrences...

A DNA algorithm for SAT, the satisfiability of propositional formulae, is presented where the number of separation steps is given by the number of clauses of the instance. This represents a computational improvement for DNA algorithms based on Adleman and Lipton’s extraction model, where the number of separations equates the number of literals of the instance.

MOTIVATION AND RESULTS The importance of Tandem Repeats in some genomes is now well established. We have reported elsewhere some interesting new results obtained by means of a preliminary program for finding Tandem Repeats in DNA sequences, together with a brief description of the basic ideas of the algorithm. We describe here a completely new program based only in part on those ideas, we brief...

in this paper, the dynamical behavior of an axially moving string modeled by fractional derivative is investigated. the governing equation represented motion is solved by the method of multiple scales. considering principal parametric resonance, the stability boundaries for string with simple supports are obtained. numerical results indicate the effects of fractional damping on stability.

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 structures that is usually undesirable f...

We propose and investigate a formal language operation inspired by the naturally occurring phenomenon of DNA primer extension by a DNAtemplate-directed DNA Polymerase enzyme. Given two DNA strings u and v, where the shorter string v (called primer) is Watson-Crick complementary and can thus bind to a substring of the longer string u (called template) the result of the primer extension is a DNA ...

With a long text string like DNA, repeats and palindromes are not easily spotted. Yet nding such substrings is important; for instance, repeats in DNA are indicators of certain hereditary disorders and are used as genetic markers. We discuss repeats and then palindromes and then we relate the two. In our discussion of repeats, we rst de ne an exact repeat and then ve de nitions of approximate r...

Articles you may be interested in Some characteristics of probabilistic one-sided splicing systems AIP Conf. Abstract. A splicing system, one of the early theoretical models for DNA computing was introduced by Head in 1987. Splicing systems are based on the splicing operation which, informally, cuts two strings of DNA molecules at the specific recognition sites and attaches the prefix of the fi...

The method of recovering Helicobacter pylori DNA or viable cells absorbed on a string that a person has swallowed and that is retrieved an hour later (string test) should be a useful alternative to traditional analysis of cells or DNA obtained by endoscopy, which is invasive, uncomfortable, relatively costly, and ill-suited for community-based and pediatric studies. Here we assayed the sensitiv...