Gene-finding with the VOM model

  • Authors:

  • K. O. Shohat-Zaidenraise;A. Shmilovici;I. Ben-Gal

  • Affiliations:

  • Department of Industrial Engineering, Tel-Aviv University, Ramat-Aviv, Tel-Aviv 69978, Israel;(Corresponding author. E-mail: armin@bgumail.bgu.ac.il) Department of Information Systems Engineering, Ben-Gurion University, P.O. Box 653, Beer-Sheva 84105, Israel;Department of Industrial Engineering, Tel-Aviv University, Ramat-Aviv, Tel-Aviv 69978, Israel

  • Venue:
  • Journal of Computational Methods in Sciences and Engineering
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present the architecture of an elementary gene-finding algorithm that is based on a Variable Order Markov model (VOM). The VOM model is a generalization of the traditional Markov model that can cope with varying memory dependencies. The VOM model is more efficient in terms of its parameterization and therefore can be trained on relatively short sequences. Experiments with the proposed gene-finder (GF) on three prokaryotic genomes indicate its potential advantage on the detection of short genes.