Length variation in D-loop mitochondrial DNA was observed after amplification with the polymerase chain reaction (PCR) in 28% of 195 evening bats, Nycticeius humeralis, from seven colonies. Nucleotide sequences of PCR products show that this heteroplasmy is characterized by an 81-bp region which is tandemly repeated five to eight times. Southern blots using PCR products as probes on HaeIII geno...

SUMMARY VISTA is a program for visualizing global DNA sequence alignments of arbitrary length. It has a clean output, allowing for easy identification of similarity, and is easily configurable, enabling the visualization of alignments of various lengths at different levels of resolution. It is currently available on the web, thus allowing for easy access by all researchers. AVAILABILITY VISTA...

The objective of this work was to ascertain the presence and degree of simple sequence repeat (SSR) DNA length polymorphism in the soybean [Glycine max (L.) Merr.]. A search of GenBank revealed no (CA)n or (GT)n SSRs with n greater than 8 in soybean. In contrast, 5 (AT)n and 1 (ATT)n SSRs with n ranging from 14 to 27 were detected. Polymerase chain reaction (PCR) primers to regions flanking the...

Summary: While achieving a compression ratio of 2.0 bits/base ,the new algorithm codes non-N bases1 in fixed length.It dramatically reduces the time of coding and decoding than previous DNA compression algorithms and some universal compression programs. Availability: http://grandlab.cer.net/topic.php?TopicID=50 Contact: [email protected] [email protected] [email protected]

Recurrent neural networks (RNNs) are widely used to model sequential data but their non-linear dependencies between sequence elements prevent parallelizing training over sequence length. We show the training of RNNs with only linear sequential dependencies can be parallelized over the sequence length using the parallel scan algorithm, leading to rapid training on long sequences even with small ...

We present the design and implementation of bounded-length sequence (BLS) variables for a CP solver. The domain of a BLS variable is represented as the combination of a set of candidate lengths and a sequence of sets of candidate characters. We show how this representation, together with requirements imposed by propagators, affects the implementation of BLS variables for a copying CP solver, mo...

A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N . Examples of such collections are version control data and genome sequences of individuals, where the differences can be expressed by lists of basic edit operations. Flexible and efficient data analysis on a such typically h...

A de Bruijn sequence is a circular binary string of length 2n that contains each binary string of length n exactly once as a substring. A maximum-density de Bruijn sequence is a circular binary string of length ( n

A k-ary de Bruijn sequence of order n is a cyclic sequence of length k in which each k-ary string of length n appears exactly once as a substring. A shift rule for a de Bruijn sequence of order n is a function that maps each length n substring to the next length n substring in the sequence. We present the first known shift rule for k-ary de Bruijn sequences that runs in O(1)-amortized time per ...

NMR experiments show that a stable complex can be formed between a 14-base-pair oligonucleotide and a disulfide-bonded dimer of a peptide containing 27 residues of the basic region of the yeast transcriptional activator GCN4; the complex is in slow exchange on the NMR time scale. In contrast, a nonspecific complex is in fast exchange on the NMR time scale. DNase I footprinting experiments show ...