Search PubMed⌕ Search

Biomedical subjects

Keith R Mitchelson

Publications and source records attributed to Keith R Mitchelson.

3 recordsLinked to original sources

The use of capillary electrophoresis for DNA polymorphism analysis.

Capillary electrophoresis has advanced enormously over the last 10 yr as a tool for DNA sequencing, driven by the human and other major genome projects and by the need for rapid electrophoresis-based DNA diagnostic tests. The common need of these analyses is a platform providing very high throughput, high-quality data, and low process costs. These demands have led to capillary electrophoresis machines with multiple capillaries providing highly parallel analyses, to new electrophoresis matrices, to highly sensitive spectrofluorometers, and to brighter, spectrally distinct fluorescent dyes with which to label DNA. Capillary devices have also been engineered onto microchip formats, on which both the amount of sample required for analysis and the speed of analysis are increased by an order of magnitude. This review examines the advances made in capillary and chip-based microdevices and in the different DNA-based assays developed for mutation detection and genotype analysis using capillary electrophoresis. The automation of attendant processes such as for DNA sample preparation, PCR, and analyte purification are also reviewed. Together, these technological developments provide the throughput demanded by the large genome-sequencing projects.

DNA Mutational Analysis↗

A simulated annealing algorithm for finding consensus sequences.

MOTIVATION: A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules. RESULTS: This paper describes a new algorithm for finding a consensus sequence, using the popular optimization method known as simulated annealing. Unlike the conventional approach of finding a consensus sequence by first forming a multiple sequence alignment, this algorithm searches for a sequence that minimises the sum of pairwise distances to each of the input sequences. The resulting consensus sequence can then be used to induce a multiple sequence alignment. The time required by the algorithm scales linearly with the number of input sequences and quadratically with the length of the consensus sequence. We present results demonstrating the high quality of the consensus sequences and alignments produced by the new algorithm. For comparison, we also present similar results obtained using ClustalW. The new algorithm outperforms ClustalW in many cases.

Algorithms↗