With growth of sequenced genome, a number of algorithms for gene identification were created. These algorithms use fixed gene features which are chosen based on observation or experience. These features may not be major features of a genome. In this paper, we illustrate several candidate features and propose a dynamic feature choosing algorithm to determine the major features. We describe nucleotide sequence by feature vector and use Discriminant analysis to them to make decision on coding/non-coding. To test the algorithm, we apply the algorithm to the S.cerevisiae genome and achieve accuracy of above 98%. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Luo, J. W., Yang, L., & Zhang, X. Z. (2007). A method for gene identification by dynamic feature choosing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4561 LNCS, pp. 678–683). Springer Verlag. https://doi.org/10.1007/978-3-540-73321-8_78
Mendeley helps you to discover research relevant for your work.