Name
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. |
Year | Venue | Keywords |
|---|---|---|
2007 | J. Comput. Meth. in Science and Engineering | elementary gene-finding algorithm,traditional markov model,varying memory dependency,prokaryotic genomes,potential advantage,variable order markov models,gene finding,variable order markov model,sequence analysis,short sequence,short gene,vom model,proposed gene-finder |
Field | DocType | Volume |
Parametrization,Markov model,Gene prediction,Algorithm,Variable-order Markov model,Mathematics,Sequence analysis | Journal | 7 |
Issue | ISSN | Citations |
1 | 1472-7978 | 0 |
PageRank | References | Authors |
0.34 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| K. O. Shohat-Zaidenraise | 1 | 0 | 0.34 |
| Armin Shmilovici | 2 | 0 | 1.01 |
| Irad E. Ben-Gal | 3 | 48 | 2.16 |