메뉴 건너뛰기




Volumn 395, Issue 2-3, 2008, Pages 158-170

Detection of subtle variations as consensus motifs

Author keywords

Binding sites; Consensus motifs; Pattern discovery; Subtle motifs; Transcription factors

Indexed keywords

ANIMAL CELL CULTURE; BINDING SITES; COMPUTATIONAL METHODS; DNA; GENES; NUCLEIC ACIDS; ORGANIC ACIDS;

EID: 45749129367     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.01.017     Document Type: Article
Times cited : (11)

References (19)
  • 1
    • 4544295425 scopus 로고    scopus 로고
    • Environmentally induced foregut remodeling by pha-4/foxa and daf-12/nhr
    • Ao W., Gaudet J., Kent W.J., Muttumu S., and Mango S.E. Environmentally induced foregut remodeling by pha-4/foxa and daf-12/nhr. Science 305 5691 (2004) 1743-1746
    • (2004) Science , vol.305 , Issue.5691 , pp. 1743-1746
    • Ao, W.1    Gaudet, J.2    Kent, W.J.3    Muttumu, S.4    Mango, S.E.5
  • 5
    • 0036110853 scopus 로고    scopus 로고
    • Finding motifs using random projections
    • Buhler J., and 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
  • 6
    • 84857005866 scopus 로고    scopus 로고
    • M. Comin, L. Parida, Subtle motif discovery for the detection of dna regulatory sites, in: Proceedings of Asia Pacific Bioinformatics Conference, APBC'07, 2007, pp. 95-104
    • M. Comin, L. Parida, Subtle motif discovery for the detection of dna regulatory sites, in: Proceedings of Asia Pacific Bioinformatics Conference, APBC'07, 2007, pp. 95-104
  • 7
    • 0344376570 scopus 로고    scopus 로고
    • Finding composite regulatory patterns in DNA sequences
    • Eskin E., and Pevzner P. Finding composite regulatory patterns in DNA sequences. Bioinformatics 18 (2002) 354-363
    • (2002) Bioinformatics , vol.18 , pp. 354-363
    • Eskin, E.1    Pevzner, P.2
  • 8
    • 0032826179 scopus 로고    scopus 로고
    • Identifying DNA and protein patterns with statistically significant alignments of multiple sequences
    • Hertz G.Z., and Stormo G.D. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 15 (1999) 563-577
    • (1999) Bioinformatics , vol.15 , pp. 563-577
    • Hertz, G.Z.1    Stormo, G.D.2
  • 9
    • 0036377219 scopus 로고    scopus 로고
    • Keich, Pevzner, Finding motifs in the twilight zone, in: Annual International Conference on Computational Molecular Biology, April 2002, pp. 195-204
    • Keich, Pevzner, Finding motifs in the twilight zone, in: Annual International Conference on Computational Molecular Biology, April 2002, pp. 195-204
  • 10
    • 0036772507 scopus 로고    scopus 로고
    • Subtle motifs: Defining the limits of motif finding algorithms
    • Keich U., and Pevzner P. Subtle motifs: Defining the limits of motif finding algorithms. Bioinformatics 18 (2002) 1382-1390
    • (2002) Bioinformatics , vol.18 , pp. 1382-1390
    • Keich, U.1    Pevzner, P.2
  • 11
    • 0025320805 scopus 로고
    • An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences
    • Lawrence C.E., and Reilly A.A. An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins: Structure, Function and Genetics 7 (1990) 41-51
    • (1990) Proteins: Structure, Function and Genetics , vol.7 , pp. 41-51
    • Lawrence, C.E.1    Reilly, A.A.2
  • 15
    • 2342476143 scopus 로고    scopus 로고
    • Finding subtle motifs by branching from sample strings
    • Price A., Ramabhadran S., and Pevzner P. Finding subtle motifs by branching from sample strings. Bioinformatics 1 (2003) 149-155
    • (2003) Bioinformatics , Issue.1 , pp. 149-155
    • Price, A.1    Ramabhadran, S.2    Pevzner, P.3
  • 17
    • 80053455778 scopus 로고    scopus 로고
    • Spelling approximate repeated or common motifs using a suffix tree
    • Latin 98: Theoretical Informatics
    • Sagot M.F. Spelling approximate repeated or common motifs using a suffix tree. Latin 98: Theoretical Informatics. Lecture Notes in Computer Science vol. 1380 (1998) 111-127
    • (1998) Lecture Notes in Computer Science , vol.1380 , pp. 111-127
    • Sagot, M.F.1
  • 19
    • 0021665479 scopus 로고
    • Pattern recognition in several sequences: Consensus and alignment
    • Waterman M.S., Aratia R., and Galas D.J. Pattern recognition in several sequences: Consensus and alignment. Bulletin of Mathematical Biology 46 4 (1984) 515-527
    • (1984) Bulletin of Mathematical Biology , vol.46 , Issue.4 , pp. 515-527
    • Waterman, M.S.1    Aratia, R.2    Galas, D.J.3


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