RescueNet 0.91 – Codon usage Anaysis and Gene Prediction

RescueNet 0.91

:: DESCRIPTION

RescueNet (Relative Synonymous Codon Usage Neural Network) uses the Self-Organizing Map neural network algorithm for codon usage anaysis and gene-prediction. In its gene prediction functionality, RescueNet can estimate multiple models of gene codon usage properties during training. This offers advantageous gene-finding performance in cases where a diverse number of codon usage patterns are displayed. Examples include metagenomic datasets and prokaryotic genomes where mutational pressure, translational efficiency and horizontal gene transfer have diversified the displayed codon usage patterns.

:: DEVELOPER

Shaun Mahony

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux/ Windows

:: DOWNLOAD

 RescueNet

:: MORE INFORMATION

Citation:

Gene prediction using the Self-Organizing Map: automatic generation of multiple gene models.
Mahony S, McInerney JO, Smith TJ, Golden A.
BMC Bioinformatics. 2004 Mar 5;5:23.

 

GAZE 0.1 – Integration of Gene Prediction data

GAZE 0.1

:: DESCRIPTION

GAZE is a tool for the integration of gene prediction signal and content sensor information into complete gene structures.

::DEVELOPER

Kevin Howe,

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux

:: DOWNLOAD

 GAZE

:: MORE INFORMATION

Citation

GAZE: a generic framework for the integration of gene-prediction data by dynamic programming.
Howe KL, Chothia T and Durbin R
Genome research2002;12;9;1418-27

GeneMark 2.5 – Gene Prediction Programs

GeneMark 2.5

:: DESCRIPTION

GeneMark developed in 1993 was the first gene finding method recognized as an efficient and accurate tool for genome projects. GeneMark was used for annotation of the first completely sequenced bacteria, Haemophilus influenzae, and the first completely sequenced archaea, Methanococcus jannaschii. The GeneMark algorithm uses species specific inhomogeneous Markov chain models of protein-coding DNA sequence as well as homogeneous Markov chain models of non- coding DNA. Parameters of the models are estimated from training sets of sequences of known type. The major step of the algorithm computes a posteriory probability of a sequence fragment to carry on a genetic code in one of six possible frames (including three frames in complementary DNA strand) or to be “non-coding”

GeneMark is documented as the most accurate prokaryotic gene finder.

GeneMark.hmm-P and GeneMark.hmm-E programs are predicting genes and intergenic regions in a sequence as a whole. They use the Hidden Markov models reflecting the “grammar” of gene organization.

The GeneMark.hmm (P and E) programs identify the maximum likely parse of the whole DNA sequence into protein coding genes (with possible introns) and intergenic regions.

To analyze ESTs and cDNAs you can use GeneMark-E.

::DEVELOPER

Mark Borodovsky , Georgia Institute of TechnologyAtlanta, Georgia, USA

:: REQUIREMENTS

  • Linux / Mac OsX

:: DOWNLOAD

GeneMark

:: MORE INFORMATION

Citation

Borodovsky M. and McIninch J.
GeneMark: parallel gene recognition for both DNA strands,
Computers & Chemistry, 1993, Vol. 17, No. 19, pp. 123-133.

Besemer J., Lomsadze A. and Borodovsky M.,
GeneMarkS: a self-training method for predicition of gene starts in microbial genomes. Implications for finding sequence motifs in regulatory regions.
Nucleic Acids Research, 2001, Vol. 29, No. 12, 2607-2618

Exit mobile version