PubMed HealthSearch

PubMed · 7460544

DALE--a system for developing computer-aided biomedical experiments.

Abstract

The implementation of new computer-aided biomedical experiments usually requires a high level of computing expertise and a significant amount of time. Acquiring this knowledge and devoting the necessary time may result in the inefficient use of a researcher's own particular skills. A number of software aids for laboratory experimentation have been developed, but it is considered that none adequately satisfies the user's requirements. DALE (direct access to laboratory equipment) has been designed as a user-oriented software system, and consists of a menu-based interactive subsystem, with which experiments are defined, and a table-driven interpreter to execute the experiment. Little computing knowledge or development time is required to implement new experiments, and experience has indicated that DALE is a useful tool for biomedical experimentation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

D A Radford, R E Cooper, H J Guy, J Larkin. 1980. DALE--a system for developing computer-aided biomedical experiments.. https://doi.org/10.1016/0010-468x(80)90110-5

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

Sensitivity and selectivity in protein similarity searches: a comparison of Smith-Waterman in hardware to BLAST and FASTA.

To predict the functions of a possible protein product of any new or uncharacterized DNA sequence, it is important first to detect all significant similarities between the encoded amino acid sequence and any accumulated protein sequence data. We have implemented a set of queries and database sequences and proceeded to test and compare various similarity search methods and their parameterizations. We demonstrate here that the Smith-Waterman (S-W) dynamic programming method and the optimized version of FASTA are significantly better able to distinguish true similarities from statistical noise than is the popular database search tool BLAST. Also, a simple "log-length normalization" of S-W scores based on the query and target sequence lengths greatly increased the selectivity of the S-W searches, exceeding the default normalization method of FASTA. An implementation of the modified S-W algorithm in hardware (the Fast Data Finder) is able to match the accuracy of software versions while greatly speeding up its execution. We present here the selectivity and sensitivity data from these tests as well as results for various scoring matrices. We present data that will help users to choose threshold score values for evaluation of database search results. We also illustrate the impact of using simple-sequence masking tools such as SEG or XNU.

Computers