The Community for Technology Leaders
13th IEEE International Conference on BioInformatics and BioEngineering (2004)
Taichung, Taiwan, ROC
May 19, 2004 to May 21, 2004
ISBN: 0-7695-2173-8
pp: 483
Wing-Kin Sung , National University of Singapore
Xiaoan Dong , National University of Singapore
Sam Yuan Sung , National University of Singapore
Chew Lim Tan , National University of Singapore
This paper introduces a novel motif discovery algorithm based on the use of constraint mechanism and constraint rules. The key idea is to convert sets of similar substrings of the DNA sequences into patterns, as early as possible, using constraint mechanism or constraint rules. The advantages are two folds. Firstly, the approach generates limited number of patterns while still guaranteeing that the actual motifs are contained in the pattern set. Secondly, the procedure for deriving patterns is very cost-effective since it can be considered as that we use many "look ahead" to speed up the procedure. Therefore, the algorithm has the advantages of the high sensitivity of pattern-driven algorithms as well as the efficiency of sample-driven algorithms.
Wing-Kin Sung, Xiaoan Dong, Sam Yuan Sung, Chew Lim Tan, "Variable Number of Tandem Repeats (VNTR) Stands", 13th IEEE International Conference on BioInformatics and BioEngineering, vol. 00, no. , pp. 483, 2004, doi:10.1109/BIBE.2004.1317381
98 ms
(Ver 3.3 (11022016))