메뉴 건너뛰기




Volumn 1, Issue 1, 2006, Pages

SMOTIF: Efficient structured pattern and profile motif search

Author keywords

[No Author keywords available]

Indexed keywords


EID: 34248361861     PISSN: None     EISSN: 17487188     Source Type: Journal    
DOI: 10.1186/1748-7188-1-22     Document Type: Article
Times cited : (24)

References (33)
  • 1
    • 0032861774 scopus 로고    scopus 로고
    • SCPD: A Promoter Database of the Yeast Saccharomyces Cerevisiae
    • 10487868
    • Zhu J Zhang M SCPD: A Promoter Database of the Yeast Saccharomyces Cerevisiae Bioinformatics 1999 15 7-8 607-11 10487868
    • (1999) Bioinformatics , vol.15 , Issue.7-8 , pp. 607-611
    • Zhu, J.1    Zhang, M.2
  • 3
    • 0027192852 scopus 로고
    • A System for Pattern Matching Applications on Biosequences
    • 8324630
    • Mehldau G Myers G A System for Pattern Matching Applications on Biosequences Computer Applications in the Biosciences 1993 9 3 299-314 8324630
    • (1993) Computer Applications in the Biosciences , vol.9 , Issue.3 , pp. 299-314
    • Mehldau, G.1    Myers, G.2
  • 4
    • 0029984787 scopus 로고    scopus 로고
    • Approximate Matching of Network Expressions with Spacers
    • 8697238
    • Myers E Approximate Matching of Network Expressions with Spacers J Comput Biol 1996 3 1 33-51 8697238
    • (1996) J Comput Biol , vol.3 , Issue.1 , pp. 33-51
    • Myers, E.1
  • 5
    • 0742269627 scopus 로고    scopus 로고
    • Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching
    • 14980017
    • Navarro G Raffinot M Fast and Simple Character Classes and Bounded Gaps Pattern Matching, with Applications to Protein Searching J Comput Biol 2003 10 6 903-23 14980017
    • (2003) J Comput Biol , vol.10 , Issue.6 , pp. 903-923
    • Navarro, G.1    Raffinot, M.2
  • 8
    • 0043019410 scopus 로고    scopus 로고
    • On-line Approximate String Searching Algorithms: Survey and Experimental Results
    • Michailidis P Margaritis K On-line Approximate String Searching Algorithms: Survey and Experimental Results International Journal of Computer Mathematics 2002 79 8 867-888
    • (2002) International Journal of Computer Mathematics , vol.79 , Issue.8 , pp. 867-888
    • Michailidis, P.1    Margaritis, K.2
  • 9
    • 0037433054 scopus 로고    scopus 로고
    • LTR_STRUC: A Novel Search and Identification Program for LTR Retrotransposons
    • 12584121
    • McCarthy E McDonald J LTR_STRUC: A Novel Search and Identification Program for LTR Retrotransposons Bioinformatics 2003 19 3 362-367 12584121
    • (2003) Bioinformatics , vol.19 , Issue.3 , pp. 362-367
    • McCarthy, E.1    McDonald, J.2
  • 10
    • 0036250001 scopus 로고    scopus 로고
    • Plant transposable elements: Where genetics meets genomics
    • 11988759
    • Feschotte C Jiang N Wessler S Plant transposable elements: Where genetics meets genomics Nature Reviews Genetics 2002 3 5 329-41 11988759
    • (2002) Nature Reviews Genetics , vol.3 , Issue.5 , pp. 329-341
    • Feschotte, C.1    Jiang, N.2    Wessler, S.3
  • 13
    • 34248373915 scopus 로고    scopus 로고
    • PhD thesis University of Zurich, Department of Informatics
    • Inenaga S String Processing Algorithms PhD thesis University of Zurich, Department of Informatics 2003
    • (2003) String Processing Algorithms
    • Inenaga, S.1
  • 16
    • 0000386785 scopus 로고
    • Finding Approximate Patterns in Strings
    • Ukkonen E Finding Approximate Patterns in Strings J Algorithms 1985 6 132-137
    • (1985) J Algorithms , vol.6 , pp. 132-137
    • Ukkonen, E.1
  • 17
    • 0002193989 scopus 로고
    • Fast String Matching with k Differences
    • Landau GM Vishkin U Fast String Matching with k Differences J Comput Syst Sci 1988 37 63-78
    • (1988) J Comput Syst Sci , vol.37 , pp. 63-78
    • Landau, G.M.1    Vishkin, U.2
  • 18
    • 0000541351 scopus 로고    scopus 로고
    • A fast bit-vector algorithm for approximate string matching based on dynamic programming
    • Myers G A fast bit-vector algorithm for approximate string matching based on dynamic programming Journal of the ACM 1999 46 3 395-415
    • (1999) Journal of the ACM , vol.46 , Issue.3 , pp. 395-415
    • Myers, G.1
  • 20
    • 23144431724 scopus 로고    scopus 로고
    • P-Match: Transcription factor binding site search by combining patterns and weight matrices
    • Web Server 1160202 15980505
    • Chekmenev D Haid C Kel A P-Match: Transcription factor binding site search by combining patterns and weight matrices Nucleic Acids Research 2005 33 Web Server W432-W437 1160202 15980505
    • (2005) Nucleic Acids Research
    • Chekmenev, D.1    Haid, C.2    Kel, A.3
  • 21
    • 0028971143 scopus 로고
    • MatInd and MatInspector: New fast and versatile tools for detection of consensus matches in nucleotide sequence data
    • 307478 8532532
    • Quandt K Frech K Karas H Wingender E Werner T MatInd and MatInspector: new fast and versatile tools for detection of consensus matches in nucleotide sequence data Nucleic Acids Research 1995 23 23 4878-4884 307478 8532532
    • (1995) Nucleic Acids Research , vol.23 , Issue.23 , pp. 4878-4884
    • Quandt, K.1    Frech, K.2    Karas, H.3    Wingender, E.4    Werner, T.5
  • 24
    • 0034826102 scopus 로고    scopus 로고
    • SPADE: An Efficient Algorithm for Mining Frequent Sequences
    • Zaki M SPADE: An Efficient Algorithm for Mining Frequent Sequences Machine Learning Journal 2001 42 1/2 1-31
    • (2001) Machine Learning Journal , vol.42 , Issue.1-2 , pp. 1-31
    • Zaki, M.1
  • 26
    • 0000821965 scopus 로고
    • On the theory and computation of evolutionary distances
    • Sellers PH On the theory and computation of evolutionary distances SIAM J Appl Math 1974 26 787-793
    • (1974) SIAM J Appl Math , vol.26 , pp. 787-793
    • Sellers, P.H.1
  • 27
    • 0034046617 scopus 로고    scopus 로고
    • Fast Probabilistic Analysis of Sequence Function Using Scoring Matrices
    • 10869016
    • Wu T Nevill-Manning C Brutlag D Fast Probabilistic Analysis of Sequence Function Using Scoring Matrices Bioinformatics 2000 16 3 233-244 10869016
    • (2000) Bioinformatics , vol.16 , Issue.3 , pp. 233-244
    • Wu, T.1    Nevill-Manning, C.2    Brutlag, D.3
  • 28
    • 0034894539 scopus 로고    scopus 로고
    • Identifying target sites for cooperatively binding factors
    • 11448879
    • Thakurta D Stormo G Identifying target sites for cooperatively binding factors Bioinformatics 2001 17 7 608-621 11448879
    • (2001) Bioinformatics , vol.17 , Issue.7 , pp. 608-621
    • Thakurta, D.1    Stormo, G.2
  • 30
    • 0033677426 scopus 로고    scopus 로고
    • Extracting Structured Motifs Using a suffix Tree - Algorithms and Application to Promoter Consensus Identification
    • 11108467
    • Marsan L Sagot M Extracting Structured Motifs Using a suffix Tree - Algorithms and Application to Promoter Consensus Identification Journal of Computational Biology 2000 7 345-354 11108467
    • (2000) Journal of Computational Biology , vol.7 , pp. 345-354
    • Marsan, L.1    Sagot, M.2
  • 33
    • 34248356673 scopus 로고    scopus 로고
    • EXMOTIF: Efficient Structured Motif Extraction
    • 17109757
    • Zhang Y Zaki MJ EXMOTIF: Efficient Structured Motif Extraction Algorithms for Molecular Biology 2006 1 21 17109757
    • (2006) Algorithms for Molecular Biology , vol.1 , pp. 21
    • Zhang, Y.1    Zaki, M.J.2


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