Search PubMed⌕ Search

Biomedical subjects

Anthony J Kearsley

Publications and source records attributed to Anthony J Kearsley.

2 recordsLinked to original sources

An operator-independent approach to mass spectral peak identification and integration.

A mathematical algorithm is presented that locates and calculates the area beneath peaks from real data using only reproducible mathematical operations and no user-selected parameters. It makes no assumptions about peak shape and requires no smoothing or preprocessing of the data. In fact, it is shown that for matrix-assisted laser desorption time-of-flight mass spectra noise exists at all frequency ranges making the smoothing of data without distortion of peak areas impossible. The algorithm is based on a time-series segmentation routine that reduces the data set to groups of three strategic points where each group defines the beginning, center, and ending of each peak located. The peak areas are found from the strategic points using a commonplace polygonal area calculation routine. Peaks with statistically insignificant height or area are then discarded. The performance of the algorithm is demonstrated on a polystyrene mass spectrum with varying degrees of noise added either mathematically or experimentally. An on-line implementation of the method, termed MassSpectator, for public use can be found at www.nist.gov/maldi.

Journal Article↗

Constructing sequence alignments from a Markov decision model with estimated parameter values.

Current methods for aligning biological sequences are based on dynamic programming algorithms. If large numbers of sequences or a number of long sequences are to be aligned, the required computations are expensive in memory and central processing unit (CPU) time. In an attempt to bring the tools of large-scale linear programming (LP) methods to bear on this problem, we formulate the alignment process as a controlled Markov chain and construct a suggested alignment based on policies that minimise the expected total cost of the alignment. We discuss the LP associated with the total expected discounted cost and show the results of a solution of the problem based on a primal-dual interior point method. Model parameters, estimated from aligned sequences, along with cost function parameters are used to construct the objective and constraint conditions of the LP problem. This article concludes with a discussion of some alignments obtained from the LP solutions of problems with various cost function parameter values.

Algorithms↗