Loading...
Please wait, while we are loading the content...
Similar Documents
Space and time efficient algorithms for planted motif search (2006)
| Content Provider | CiteSeerX |
|---|---|
| Author | Rajasekaran, Sanguthevar Balla, Sudha Davila, Jaime |
| Description | Proc. 6th International Conference on Computational Science (ICCS 2006)/ 2nd International Workshop on Bioinformatics Research and Applications (IWBRA 2006) LNCS 3992 |
| Abstract | 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 |
| File Format | |
| Publisher Date | 2006-01-01 |
| Access Restriction | Open |
| Subject Keyword | Genomic Information Particular Algorithm Pmsp Time Efficient Algorithm Transcription Factor-binding Site Motif Search Problem Challenge Instance Large Value Exact Algorithm Algorithm Pmsi |
| Content Type | Text |
| Resource Type | Conference Proceedings Article |
