A generic algorithm for finding restriction sites within DNA sequences

This paper describes a generic algorithm for finding restrictionsites within DNA sequences. The ‘genericity’ ofthe algorithm is made possible through the use of set theory.Basic elements of DNA sequences, i.e. nucleotides (bases), arerepresented in sets, and DNA sequences, whether specific, ambiguousor even protein-coding, are represented as sequences of thosesets. The set intersection operation demonstrates its abilityto perform pattern-matching correctly on various DNA sequences.The performance analysis showed that the degree of complexityof the pattern matching is reduced from exponential to linear.An example is given to show the actual and potential restrictionsites, derived by the generic algorithm, in the DNA sequencetemplate coding for a synthetic calmodulin. Received on October 2, 1990; accepted on December 18, 1990     

Conformationally altered aortic myosin light chains

Aorta smooth myosin contains two types of light chain, LC20 and LC17, which fold together with the N-terminal region of each heavy chain to form the globular head region of myosin. We demonstrate an altered conformation of LC20 after its separation from heavy chain by high concentrations of urea, on the basis of the following evidende: 1) A polyclonal antibody against LC20 was not able to recognize this conformationally altered form; 2) Myosin reconstituted from heavy chains and urea-dissociated light chains exhibited extremely low ATPase activity. Circular dichroism unfolding profiles showed that light chains dissociated from heavy chains by SDS appeared to be more stable than those generated by urea dissociation.