Image processing software for enhanced visualization of faint or noisy autoradiographic images

A computer program for digital image processing is described which can be implemented using scanning densitometer hardware pre-existing in most biology departments plus computer video hardware which may either pre-exist in the biology department or would represent a moderate upgrade over an already planned computer purchase. The primary purpose of this computer program is to provide contrast enhancement of faint or low contrast autoradiograph images and to implement background subtraction and digital smoothing methods which permit visualization of blurry electrophoresis bands against noisy backgrounds. However, the program also has modest editing capabilities that allow its use in the routine preparation of images for publication. Finally, the program has facilities for deblurring, edge enhancement and multiple image averaging, which give it usefulness in other forms of photographic analysis.     

Automatic identification of structural gene fragments using a set of peptides

A computer program is designed to facilitate the identification of coding gene's fragments using a set of peptides. The program is written on Basic programming language for personal computer "Iskra-226" (USSR). To accelerate some operations, computer code commands are used. Treatment of 50 DNA fragments by means of 10 peptides takes ca. 1 h of computer time. The program outputs list coding gene's fragments and corresponding peptides. The suggested algorithm is based on our finding that the number of false identifications of a coding gene fragments may be predicted by Poisson distribution and minimized using correct criteria. The suggested method enables one to evaluate the reliability of the true identification of DNA fragments in case of mistakes in primary structure of the gene fragments or peptides.     

A computer program for the implicit regression of the Hill equation]

A computer program for implicit regression of the Hill equation. The fundamentals for the regression of implicit functions following the Gauss method are dealt with. Basing on these fundamentals a program for the regression of the Hill equation is described. The binding constant, the Hill coefficient and end extinction can be estimated. The mean errors of parameters were calculated in the linear model. The program was written in ALGOL 60 for the computer Robotron 300. The program is available on request.     

A flexible new computer program for handling DNA sequence data.

A compact new computer program for handling nucleic acid sequence data is presented. It consists of a number of different subsets, which may be used according to a given code system. The program is designed for the determination of restriction enzyme and other recognition sites in correlation with translation patterns, and allows tabulation of codon frequencies and protein molecular weights within specified gene boundaries. The program is especially designed for detection of overlapping genes. The language, is FORTRAN and thus the program may be used on small computers; it may also be used without any prior computer experience. Copies are available on request.     

Validation of a computer software program for statistical analysis of accelerated stability studies on biological standards.

Long-term stability is an essential requirement for biological measurement standards and it has been evaluated by applying the Arrhenius model to the data obtained from accelerated thermostability studies. A computer program DEGTEST suited to a mainframe computer has been used for evaluating the stability of biological standards for more than a decade. This paper describes the validation of a computer program executable in a personal computer Microsoft Windows XP environment for the analysis of accelerated thermostability study data.     

Evolutionary computer programming of protein folding and structure predictions

In order to understand the mechanism of protein folding and to assist the rational de-novo design of fast-folding, non-aggregating and stable artificial enzymes it is very helpful to be able to simulate protein folding reactions and to predict the structures of proteins and other biomacromolecules. Here, we use a method of computer programming called "evolutionary computer programming" in which a program evolves depending on the evolutionary pressure exerted on the program. In the case of the presented application of this method on a computer program for folding simulations, the evolutionary pressure exerted was towards faster finding deep minima in the energy landscape of protein folding. Already after 20 evolution steps, the evolved program was able to find deep minima in the energy landscape more than 10 times faster than the original program prior to the evolution process.     

On extending the usefulness of projectors in teaching biology

This paper reports the design of an interactive computer program in microbial genetics. The computer program is divided into three stages, background information, simulation, and data treatment. The results obtained from the simulation allow four genes to be sequenced along the bacterial chromosome. The simulation mimics experimental errors, the production of exconjugants and backmutants. The data can be analysed using options contained in the program. The simulation is of particular educational value because it allows the student to work at his own pace and to develop his ability to analyse data in relation to a complex conceptual model.     

A contig assembly program based on sensitive detection of fragment overlaps.

An effective computer program for assembling DNA fragments, the contig assembly program (CAP), has been developed. In the CAP program, a filter is used to eliminate quickly fragment pairs that could not possibly overlap, a dynamic programming algorithm is applied to compute the maximal-scoring overlapping alignment between each remaining pair of fragments, and a simple greedy approach is employed to assemble fragments in order of alignment scores. To identify the true fragment overlaps, the dynamic programming algorithm uses specially chosen sets of alignment parameters to tolerate sequencing errors and to penalize "mutational" changes between different copies of a repetitive sequence. The performance tests of the program on fragment data from genomic sequencing projects produced satisfactory results. The CAP program is efficient in computer time and memory; it took about 4 h to assemble a set of 1015 fragments into long contigs on a Sun workstation.     

Computer program for the IBM personal computer which searches for approximate matches to short oligonucleotide sequences in long target DNA sequences.

We describe a program which may be used to find approximate matches to a short predefined DNA sequence in a larger target DNA sequence. The program predicts the usefulness of specific DNA probes and sequencing primers and finds nearly identical sequences that might represent the same regulatory signal. The program is written in the C programming language and will run on virtually any computer system with a C compiler, such as the IBM/PC and other computers running under the MS/DOS and UNIX operating systems. The program has been integrated into an existing software package for the IBM personal computer (see article by Mount and Conrad, this volume). Some examples of its use are given.     

Applying a computer program,based on a developed mathematical model,to protect cereal crops from leaf beetles (Oulema spp.)

In many countries, including Poland, one of the most economically significant pests on cereal crops are leaf beetles (Oulema spp.). Determining the optimum time for chemical control of Oulema spp. is not easy due to extended duration of egg laying and larval development of the species. For this reason, cereal crops producers are not always able to determine correctly proper timing for a chemical treatment. Research conducted in the years 2006–2009 in the conditions of Wielkopolska province regarded short-term forecasting of leaf beetles on cereal crops using a computer program. The program is based on a mathematical model of multiple curvilinear regression equation. The computer program is of assistance when making a decision to set an optimum date for Oulema spp. control. The differences between the date set by the computer program and the date set using signalling oscillated between + 2 and ?2 days.     

Computer treatment of gas-liquid chromatographic data, with special reference to fatty acid methyl esters

A computer program is described which analyzes output punched directly onto paper tape from a gas-liquid chromatograph. Although this program was written specifically for samples of fatty acid methyl esters derived from adipose tissue triglycerides which are eluted within 1 hr, modification of the dimension statements in the program would enable it to deal with samples which require a longer time to come off the column. The salient features of the rationale of the program are discussed in detail, particularly the procedures for base line correction and for estimating the contributions from components which are not perfectly separated in the column. Examples are given of the program in practice, of comparing the results it gives with those obtained by manual triangulation of the areas on a recorder chart, and of indicating the range of column load over which we have found that it operates satisfactorily. A sample computer print-out from the program is presented and interpreted.     

A computer program for Wiener filtering of evoked potential data.

We have developed a computer program for Wiener filtering of evoked potential data. The basic algorithm involves computation of the difference berween the power spectrum of the sweep sum and the sum of power spectra of individual sweeps. Power spectra are computed by means of the discrete Fourier transform. The program is now being run on a LSI-11 computer in a neurophysiology research laboratory to analyze somatic evoked potential data from monkeys.     

Focus on the patentability of computer programs

The Nuts and Bolts section of our Journal (mirrored on the ICCNS society web site), is meant to provide a very practical way to share useful information, that goes beyond the scope of cell signaling and basic CCN protein biology. Considering the number of requests we have had for information related to protection of Intellectual Property (IP), I am pleased to initiate what will be a series of articles that will focus on various IP topics. The inaugural topic is the protection of computer programs. Some colleagues may wonder how and why the patentability of computer programs is a topic of interest for scientists working on CCN proteins . . . As a matter of fact, to assist us in analyzing the potential involvement of CCN3 in human genetic diseases, we considered developing a computer program designed to analyze large amounts of data. Sharing the concepts and the computer program raised concerns regarding IP and protection of the software that we would handle. We believe that many colleagues have encountered similar problems. This article provides a short focus on computer program patentability. It is aimed to provide basic legal information, and to help our readers in understanding the process. It is not intended to replace IP counselors or technology transfer departments. Future articles will address other practical aspects of IP protection.     

Profile sequence analysis and database searches on a transputer machine connected to a Macintosh computer

An implementation of Profilesearch (a technique to search forrelationships between a protein sequence and multiply alignedsequences) for a parallel computer is described. The numbercrunchingmachine, consisting of 21 T800 transputers, is connected toa Macintosh IIcx host computer. The program utilizes a standardMacintosh application as its user–interface, resultingin a transparent and user–friendly environment for addressingthe parallel computer. The program is independent of the nwnberof available processors and exceeds the speed of a VAXstation3200 with only one transputer in operation, thus allowing cheapand fast database searches with a PC frontend. For a largernwnber of processors, the speed increase is approximately linearwith no obvious symptoms of saturation with the available maximwnof 21 transputers. The program and environment are usefid tosearch quickly and easily for similarities between a singlesequence or sequence set and individual sequences containedin a large database. The alignment is determined by typicaldynamic programming techniques.     

The SEQANAL and SEQTALK programs: a new method of access to high-resolution nucleotide sequence comparison and analysis programs from a remote laboratory mini- or microcomputer

A new method of access has been devised for biologists requiringthe use of computer programs offering high-resolution analysisand comparison of nucleotide sequence data. The strategy involvesthe development of a pair of computer programs, called SEQANALand SEQTALK, designed to operate in tandem. SEQANAL is a largeand complex program intended to be used to discover regionsof internal repeats and dyad symmetries within one sequence,or regions of homology, complementarity or optimal alignmentbetween two sequences. Three algorithms are supported: thoseof Staden (1977, 1978); of Korn et al. (1977); Queen and Korn(1980); and the newly-described exhaustive tree-searching algorithmof Burnett et al. (1985, 1986). The SEQTALK program is a small,portable, interactive, frontend program with which the usercan specify the instructions to control the SEQANAL program.Together, the SEQANAL and SEQTALK programs permit analyses tobe performed at a remote facility on a mainframe computer underthe complete control of a distant user equipped with minimalcomputing facilities, and without needing networking facilities. Received on May 23, 1985; accepted on August 13, 1985     

A computer program for characterizing root system branching patterns

A computer program is presented which measures the length, branching patterns and distribution of link length within a root system. The program skeletonizes digitized images of root systems, loads these images into a binary tree data structure and uses this data structure to characterize the root systems. Measurements of the root length and topological parameters of root systems of Senecio vulgaris made by hand and by computer program were linearly related, with r² values greater than 0.99 in all cases.     

An improved algorithm for finding diagnostic taxonomic descriptions

A computer program is described which finds sets of diagnostic characters for the recognition of species. Unlike previous algorithms, it finds all the possible sets requested and will also run with reasonable demands on computer time and storage. The program will search for sets with a specified size range and with a given minimum number of diagnostic characters to distinguish a taxon from all the others.     

Plant Taxonomy Today

A computer program for genetic models which has some useful and labour saving features is described. The program allows students with only a rudimentary knowledge of programming to cope easily with complex genetic models. Some applications of the program are discussed.