Please use this identifier to cite or link to this item:
|Title:||Constraint based method for finding motifs in DNA sequences||Authors:||Dong, X.
|Issue Date:||2004||Citation:||Dong, X.,Sung, S.Y.,Sung, W.-K.,Tan, C.L. (2004). Constraint based method for finding motifs in DNA sequences. Proceedings - Fourth IEEE Symposium on Bioinformatics and Bioengineering, BIBE 2004 : 483-490. ScholarBank@NUS Repository.||Abstract:||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.||Source Title:||Proceedings - Fourth IEEE Symposium on Bioinformatics and Bioengineering, BIBE 2004||URI:||http://scholarbank.nus.edu.sg/handle/10635/40079||ISBN:||0769521738|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 18, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.