메뉴 건너뛰기




Volumn 7, Issue 4, 2010, Pages 752-762

VARUN: Discovering extensible motifs under saturation constraints

Author keywords

computational genomics; Computational genomics; data mining; motif; pattern discovery; protein family.; protein sequence

Indexed keywords

GENOMICS; MOTIF; PATTERN DISCOVERY; PROTEIN FAMILY.; PROTEIN SEQUENCE;

EID: 78149283787     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2008.123     Document Type: Article
Times cited : (25)

References (20)
  • 2
    • 0242438178 scopus 로고    scopus 로고
    • Monotony of surprise and large scale quest for unusual words
    • A. Apostolico, M.E. Bock, and S. Lonardi, "Monotony of Surprise and Large Scale Quest for Unusual Words," J. Computational Biology, vol. 10, nos. 3/4, pp. 283-311, 2003.
    • (2003) J. Computational Biology , vol.10 , Issue.3-4 , pp. 283-311
    • Apostolico, A.1    Bock, M.E.2    Lonardi, S.3
  • 4
    • 1842503722 scopus 로고    scopus 로고
    • Incremental paradigms for motif discovery
    • A. Apostolico and L. Parida, "Incremental Paradigms for Motif Discovery," J. Computational Biology, vol. 11, no. 1, pp. 15-25, 2004.
    • (2004) J. Computational Biology , vol.11 , Issue.1 , pp. 15-25
    • Apostolico, A.1    Parida, L.2
  • 6
    • 33747823564 scopus 로고    scopus 로고
    • MEME: Discovering and analyzing DNA and protein sequence motifs
    • T. Bailey, N. Williams, C. Misleh, and W. Li, "MEME: Discovering and Analyzing DNA and Protein Sequence Motifs," Nucleic Acids Research, vol. 34, pp. W369-W373, 2006.
    • (2006) Nucleic Acids Research , vol.34
    • Bailey, T.1    Williams, N.2    Misleh, C.3    Li, W.4
  • 9
    • 0036110853 scopus 로고    scopus 로고
    • Finding motifs using random projections
    • J. Buhler and M. Tompa, "Finding Motifs Using Random Projections," J. Computational Biology, vol. 9, no. 2, pp. 225-242, 2002.
    • (2002) J. Computational Biology , vol.9 , Issue.2 , pp. 225-242
    • Buhler, J.1    Tompa, M.2
  • 10
    • 17744370935 scopus 로고    scopus 로고
    • An inexact suffix tree based algorithm for extensible pattern discovery
    • A. Chattaraj and L. Parida, "An Inexact Suffix Tree Based Algorithm for Extensible Pattern Discovery," Theoretical Computer Science, vol. 335, no. 1, pp. 3-14, 2005.
    • (2005) Theoretical Computer Science , vol.335 , Issue.1 , pp. 3-14
    • Chattaraj, A.1    Parida, L.2
  • 11
    • 0032826179 scopus 로고    scopus 로고
    • Identifying DNA and protein patterns with statistically significant alignments of multiple sequences
    • G.Z. Hertz and G.D. Stormo, "Identifying DNA and Protein Patterns with Statistically Significant Alignments of Multiple Sequences," Bioinformatics, vol. 15, pp. 563-577, 1999.
    • (1999) Bioinformatics , vol.15 , pp. 563-577
    • Hertz, G.Z.1    Stormo, G.D.2
  • 13
    • 0027912333 scopus 로고
    • Detecting subtle sequence signals: A gibbs sampling strategy for multiple alignment
    • Oct.
    • C.E. Lawrence, S.F. Altschul, M.S. Boguski, J.S. Liu, A.F. Neuwald, and J.C. Wootton, "Detecting Subtle Sequence Signals: A Gibbs Sampling Strategy for Multiple Alignment," Science, vol. 262, pp. 208-214, Oct. 1993.
    • (1993) Science , vol.262 , pp. 208-214
    • Lawrence, C.E.1    Altschul, S.F.2    Boguski, M.S.3    Liu, J.S.4    Neuwald, A.F.5    Wootton, J.C.6
  • 14
    • 0029795578 scopus 로고    scopus 로고
    • Over and under-representation of short DNA words in herpesvirus genomes
    • M.Y. Leung, G.M. Marsh, and T.P. Speed, "Over and Under-representation of Short DNA Words in Herpesvirus Genomes," J. Computational Biology, vol. 3, pp. 345-360, 1996.
    • (1996) J. Computational Biology , vol.3 , pp. 345-360
    • Leung, M.Y.1    Marsh, G.M.2    Speed, T.P.3
  • 20
    • 0032861774 scopus 로고    scopus 로고
    • SCPD: A promoter database of the yeast saccha-romyces cerevisiae
    • J. Zhu and M. Zhang, "SCPD: A Promoter Database of the Yeast Saccha-Romyces Cerevisiae," Bioinformatics, vol. 15, pp. 607-611, 1999.
    • (1999) Bioinformatics , vol.15 , pp. 607-611
    • Zhu, J.1    Zhang, M.2


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