© IRL Press at Oxford University Press
gm: a practical tool for automating DNA sequence analysis
1Center for Advanced Computing in Molecular and Cellular Biology, Computing Research Laboratory Box 3000I/3CRL
2Department of Computer Science Box 3000I/3CV, New Mexico State University, Las Cruces, NM 88003-0001, USA
*To whom reprint requests should be sent
The gm (gene modeler) program automates the identification of candidate genes in anonymous, genomic DNA sequence data, gm accepts sequence data, organism-specific consensus matrices and codon asymmetry tables, and a set of parameters as input; it returns a set of models describing the structures of candidate genes in the sequence and a corresponding set of predicted amino acid sequences as output, gm is implemented in C, and has been tested on Sun, VAX, Sequent, MIPS and Cray computers. It is capable of analyzing sequences of several kilobases containing multi-exon genes in >1 min execution time on a Sun 4/60.
Received on December 4, 1989; accepted on February 28, 1990
This article has been cited by other articles:
![]() |
C. Mathe, M.-F. Sagot, T. Schiex, and P. Rouze Current methods of gene prediction, their strengths and weaknesses Nucleic Acids Res., October 1, 2002; 30(19): 4103 - 4117. [Abstract] [Full Text] [PDF] |
||||
![]() |
G. D. Stormo Gene-Finding Approaches for Eukaryotes Genome Res., April 1, 2000; 10(4): 394 - 397. [Full Text] |
||||
![]() |
J. G. Henikoff and S. Henikoff Drosophila Genomic Sequence Annotation Using the BLOCKS+ Database Genome Res., April 1, 2000; 10(4): 543 - 546. [Abstract] [Full Text] |
||||

