A microcomputer program for the correlating of two ordered lists of numbers
β Scribed by R.D. Kent; M. Schlesinger
- Publisher
- Elsevier Science
- Year
- 1981
- Tongue
- English
- Weight
- 228 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0010-4655
No coin nor oath required. For personal study only.
β¦ Synopsis
Programming language used: PDP Assembler, (Fortran driver Method of rolution available)
Iterative 'compare' statements.
High speed storage required: 878 words
Restrictions on the complexity of the problem
As given, the program treats only cases where, at most, two No. of bits in a word: 16 entries differ.
Overlay structure: none 2)'pical running time Depending on the length of the list to be analyzed. Typi-No. of magnetic tapes required: none cally for 10 numbers, 10-15 ms.
Other peripherals used: line printer * Research supported by the Natural Sciences and Engineer-equal. We are concerned with the cases where no ing Research Council of Canada.
π SIMILAR VOLUMES
An Applesoft BASIC program is presented which allows one to readily graph the secondary struclhre of a protein on the basis of information derived from its amino acid sequence. This applies the Chou/Fasman rutes of predictions to the a-helix, fl-sheet and coil conformational parameters. The program
Subjectivity in selecting random grid squares for routine quantitative analysis can be circumvented through a combination of finder grids and a computer program. The simple BASIC program described in this paper generates a list of random grid-square numbers, which are sequentially analyzed. The conc
A formula is derived to enable the calculation of the true height of an object, such as a shadowed latex bead, from electron micrographs. Knowing only the angle of shadowing and the length of the evaporated shadow, and by substituting these values in the derived formula, a microcomputer may be progr
This paper presents a program written for the Texas Instruments SR-52 programmable calculator to numerically solve a pair of first order ordinary differential equations. The program uses a fourth order Runga-Kutta method and a typical sample run is presented.