메뉴 건너뛰기




Volumn 3992 LNCS - II, Issue , 2006, Pages 822-829

Space and time efficient algorithms for planted motif search

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE; GENES; GENETIC ENGINEERING; PROBLEM SOLVING; SEARCH ENGINES;

EID: 33746616844     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11758525_110     Document Type: Conference Paper
Times cited : (38)

References (12)
  • 1
    • 84941154518 scopus 로고    scopus 로고
    • Approximation algorithms for the primer selection, planted motif search and related problems
    • To Appear
    • Balla, S., Davila, J., Rajasekaran, S.: Approximation Algorithms for the Primer Selection, Planted Motif Search and Related Problems. In: Approximation Algorithms and Metaheuristics. (To Appear)
    • Approximation Algorithms and Metaheuristics
    • Balla, S.1    Davila, J.2    Rajasekaran, S.3
  • 2
    • 0036110853 scopus 로고    scopus 로고
    • Finding motifs using random projections
    • Buhler, J., Tompa, M.: Finding motifs using random projections. Journal of Computational Biology 9(2) (2002) 225-242
    • (2002) Journal of Computational Biology , vol.9 , Issue.2 , pp. 225-242
    • Buhler, J.1    Tompa, M.2
  • 3
    • 84856991447 scopus 로고    scopus 로고
    • Voting algorithms for discovering long motifs
    • Chin, F.Y., Leung, H.C.: Voting algorithms for discovering long motifs. In: APBC. (2005)
    • (2005) APBC
    • Chin, F.Y.1    Leung, H.C.2
  • 4
    • 0344376570 scopus 로고    scopus 로고
    • Finding composite regulatory patterns in dna sequences
    • Eskin, E., Pevzner, P.A.: Finding composite regulatory patterns in dna sequences. In: ISMB. (2002) 354-363
    • (2002) ISMB , pp. 354-363
    • Eskin, E.1    Pevzner, P.A.2
  • 5
    • 33746614526 scopus 로고    scopus 로고
    • Toward optimal motif enumeration
    • Evans, P., Smith, A.: Toward optimal motif enumeration. In: WADS. (2003)
    • (2003) WADS
    • Evans, P.1    Smith, A.2
  • 7
    • 0141653290 scopus 로고    scopus 로고
    • On the closest string and substring problems
    • Li, M., Ma, B., Wang, L.: On the closest string and substring problems. Journal of the ACM 49(2) (2002) 157-171
    • (2002) Journal of the ACM , vol.49 , Issue.2 , pp. 157-171
    • Li, M.1    Ma, B.2    Wang, L.3
  • 8
    • 0034565285 scopus 로고    scopus 로고
    • Combinatorial approaches to finding subtle signals in DNA sequences
    • Pevzner, P.A., Sze, S.H.: Combinatorial approaches to finding subtle signals in DNA sequences. In: ISMB. (2000) 269-278
    • (2000) ISMB , pp. 269-278
    • Pevzner, P.A.1    Sze, S.H.2
  • 9
    • 2342476143 scopus 로고    scopus 로고
    • Finding subtle motifs by branching from sample strings
    • Price, A.L., Ramabhadran, S., Pevzner, P.A.: Finding subtle motifs by branching from sample strings. In: ECCB. (2003) 149-155
    • (2003) ECCB , pp. 149-155
    • Price, A.L.1    Ramabhadran, S.2    Pevzner, P.A.3
  • 10
    • 27644521314 scopus 로고    scopus 로고
    • Exact algorithms for planted motif problems
    • Rajasekaran, S.: Exact algorithms for planted motif problems. Journal of Computational Biology 12(8) (2005) 1117-1128
    • (2005) Journal of Computational Biology , vol.12 , Issue.8 , pp. 1117-1128
    • Rajasekaran, S.1
  • 12
    • 68249130805 scopus 로고    scopus 로고
    • Integrating sample-driven and pattern-driven approaches in motif finding
    • Sze, S.H., Lu, S., Chen, J.: Integrating sample-driven and pattern-driven approaches in motif finding. In: WABI. (2004)
    • (2004) WABI
    • Sze, S.H.1    Lu, S.2    Chen, J.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.