Results 1 -
3 of
3
Space and time efficient algorithms for planted motif search
- Proc. 6th International Conference on Computational Science (ICCS 2006)/ 2nd International Workshop on Bioinformatics Research and Applications (IWBRA 2006) LNCS 3992
, 2006
"... Abstract. We consider the (l, d) Planted Motif Search Problem, a problem that arises from the need to find transcription factor-binding sites in genomic information. We propose the algorithms PMSi and PMSP which are based on ideas considered in PMS1 [10]. These algorithms are exact, make use of less ..."
Abstract
-
Cited by 6 (4 self)
- Add to MetaCart
Abstract. We consider the (l, d) Planted Motif Search Problem, a problem that arises from the need to find transcription factor-binding sites in genomic information. We propose the algorithms PMSi and PMSP which are based on ideas considered in PMS1 [10]. These algorithms are exact, make use of less space than the known exact algorithms such as PMS and are able to tackle instances with large values of d. In particular algorithm PMSP is able to solve the challenge instance (17, 6), which has not reported solved before in the literature. 1
Lecture 10: Motif Finding
"... First discovered in 1961 by Francois Jacob and Jacques Monod in Paris, regulation genes are a type of gene that provides the instructions for creating proteins which help control the expression of other structural genes. These genes play a key role in gene expression. ..."
Abstract
- Add to MetaCart
First discovered in 1961 by Francois Jacob and Jacques Monod in Paris, regulation genes are a type of gene that provides the instructions for creating proteins which help control the expression of other structural genes. These genes play a key role in gene expression.
