Abstract：Rough sets theory is used to deal with the data of primate DNA sequence splice sites in this paper. The variables of data are selected. The genetic algorithms is modified by rough sets and coded as rough set genetic algorithms based on the rough sets theory result. The solution is searched for the second times by genetic algorithms. The rough set genetic algorithms answer space is efficiently restricted,and its efficience of getting answer is strengthed. Rough set-genetic algorithm is likely to get the useful information which is deleted by rough sets theory,to advance the algorithms the ability of searching the answer. The correctness percent reaches 90. 66%,which is obviously better than other methods got the results.
收稿日期: 2006-01-25
引用本文:
张运陶,丁保淼,黎云祥. RS-GA-KNN算法识别灵长类动物DNA序列剪接位点[J]. , 2006, 45(1): 0-0.
张运陶,丁保淼,黎云祥. Rough set-genetic algorithms-k-nearest neighbor and its application in DNA sequence splice sites recognition. , 2006, 45(1): 0-0.
