메뉴 건너뛰기




Volumn 5077 LNAI, Issue , 2008, Pages 374-388

Efficient string mining under constraints via the deferred frequency index

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; DATA MINING; DATA STRUCTURES; DECISION SUPPORT SYSTEMS; DNA SEQUENCES; ELECTRONIC COMMERCE; FILE ORGANIZATION; INFORMATION MANAGEMENT; KNOWLEDGE MANAGEMENT; MEDICAL APPLICATIONS; MINING; NUCLEIC ACIDS; ORGANIC ACIDS; SEARCH ENGINES;

EID: 48949093349     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70720-2_29     Document Type: Conference Paper
Times cited : (7)

References (26)
  • 1
    • 34547335088 scopus 로고    scopus 로고
    • Frequent pattern mining: Current status and future directions
    • Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov. 15(1), 55-86 (2007)
    • (2007) Data Min. Knowl. Discov , vol.15 , Issue.1 , pp. 55-86
    • Han, J.1    Cheng, H.2    Xin, D.3    Yan, X.4
  • 3
  • 4
    • 38449108806 scopus 로고    scopus 로고
    • Computational analyses of eukaryotic promoters
    • S
    • Zhang, M.Q.: Computational analyses of eukaryotic promoters. BMC Bioinformatics 8(Supp 6), S3 (2007)
    • (2007) BMC Bioinformatics , vol.8 , Issue.SUPP 6 , pp. 3
    • Zhang, M.Q.1
  • 5
    • 33750402176 scopus 로고    scopus 로고
    • A new representation for protein secondary structure prediction based on frequent patterns
    • Birzele, F., Kramer, S.: A new representation for protein secondary structure prediction based on frequent patterns. Bioinformatics 22(21), 2628-2634 (2006)
    • (2006) Bioinformatics , vol.22 , Issue.21 , pp. 2628-2634
    • Birzele, F.1    Kramer, S.2
  • 6
    • 38049141180 scopus 로고    scopus 로고
    • Discriminative motif discovery in dna and protein sequences using the DEME algorithm
    • Redhead, E., Bailey, T.L.: Discriminative motif discovery in dna and protein sequences using the DEME algorithm. BMC Bioinformatics 8, 385 (2007)
    • (2007) BMC Bioinformatics , vol.8 , pp. 385
    • Redhead, E.1    Bailey, T.L.2
  • 7
    • 33750361736 scopus 로고    scopus 로고
    • Fast frequent string mining using suffix arrays. In: IEEE ICDM
    • Los Alamitos
    • Fischer, J., Heun, V., Kramer, S.: Fast frequent string mining using suffix arrays. In: IEEE ICDM 2005, pp. 609-612. IEEE Computer Society Press, Los Alamitos (2005)
    • (2005) 609-612. IEEE Computer Society Press , pp. 2005
    • Fischer, J.1    Heun, V.2    Kramer, S.3
  • 10
    • 24144495447 scopus 로고    scopus 로고
    • Lee, S.D., Raedt, L.D.: An efficient algorithm for mining string databases under constraints. In: Goethals, B., Siebes, A. (eds.) KDID 2004. LNCS, 3377, pp. 108-129. Springer, Heidelberg (2005)
    • Lee, S.D., Raedt, L.D.: An efficient algorithm for mining string databases under constraints. In: Goethals, B., Siebes, A. (eds.) KDID 2004. LNCS, vol. 3377, pp. 108-129. Springer, Heidelberg (2005)
  • 12
    • 33750309692 scopus 로고    scopus 로고
    • Fischer, J., Heun, V., Kramer, S.: Optimal string mining under frequency constraints. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), 4213, pp. 139-150. Springer, Heidelberg (2006)
    • Fischer, J., Heun, V., Kramer, S.: Optimal string mining under frequency constraints. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 139-150. Springer, Heidelberg (2006)
  • 13
    • 33746034182 scopus 로고    scopus 로고
    • Fischer, J., Heun, V.: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, 4009, pp. 36-48. Springer, Heidelberg (2006)
    • Fischer, J., Heun, V.: Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 36-48. Springer, Heidelberg (2006)
  • 14
    • 85028161017 scopus 로고    scopus 로고
    • Manber, U., Myers, E.: Suffix arrays: a new method for on-line string searches. In: SODA 1990, pp. 319-327. SIAM, Philadelphia (1990)
    • Manber, U., Myers, E.: Suffix arrays: a new method for on-line string searches. In: SODA 1990, pp. 319-327. SIAM, Philadelphia (1990)
  • 15
    • 0042695715 scopus 로고    scopus 로고
    • Efficient implementation of lazy suffix trees
    • Giegerich, R., Kurtz, S., Stoye, J.: Efficient implementation of lazy suffix trees. Software Pract. Exper. 33(11), 1035-1049 (2003)
    • (2003) Software Pract. Exper , vol.33 , Issue.11 , pp. 1035-1049
    • Giegerich, R.1    Kurtz, S.2    Stoye, J.3
  • 16
    • 0029542348 scopus 로고
    • A comparison of imperative and purely functional suffix tree constructions
    • Giegerich, R., Kurtz, S.: A comparison of imperative and purely functional suffix tree constructions. Sci. Comput. Program. 25, 187-218 (1995)
    • (1995) Sci. Comput. Program , vol.25 , pp. 187-218
    • Giegerich, R.1    Kurtz, S.2
  • 17
    • 48949096284 scopus 로고    scopus 로고
    • Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: 8.2: Counting sort. In: Introduction to Algorithms, 2nd edn., pp. 168-170. MIT Press and McGraw-Hill (2001)
    • Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: 8.2: Counting sort. In: Introduction to Algorithms, 2nd edn., pp. 168-170. MIT Press and McGraw-Hill (2001)
  • 19
    • 38549097071 scopus 로고    scopus 로고
    • The UniProt Consortium: The Universal Protein Resource (UniProt). Nucl. Acids Res. 36(suppl_1), D190-D195 (2008), ftp://ftp.ebi.ac.uk/pub/databases/ integr8/uniprot/proteomes
    • The UniProt Consortium: The Universal Protein Resource (UniProt). Nucl. Acids Res. 36(suppl_1), D190-D195 (2008), ftp://ftp.ebi.ac.uk/pub/databases/ integr8/uniprot/proteomes
  • 21
    • 48949095755 scopus 로고    scopus 로고
    • Dong, G., Li, J.: Efficient mining of emerging patterns: discovering trends and differences. In: KDD 1999, pp. 43-52. ACM, New York (1999)
    • Dong, G., Li, J.: Efficient mining of emerging patterns: discovering trends and differences. In: KDD 1999, pp. 43-52. ACM, New York (1999)
  • 22
    • 0033227559 scopus 로고    scopus 로고
    • Reducing the space requirement of suffix trees
    • Kurtz, S.: Reducing the space requirement of suffix trees. Software Pract. Exper. 29(13), 1149-1171 (1999)
    • (1999) Software Pract. Exper , vol.29 , Issue.13 , pp. 1149-1171
    • Kurtz, S.1
  • 23
    • 84942799741 scopus 로고    scopus 로고
    • Li, J., Dong, G., Ramamohanarao, K.: Making use of the most expressive jumping emerging patterns for classification. In: PADKK 2000, pp. 220-232. Springer, Heidelberg (2000)
    • Li, J., Dong, G., Ramamohanarao, K.: Making use of the most expressive jumping emerging patterns for classification. In: PADKK 2000, pp. 220-232. Springer, Heidelberg (2000)
  • 24
    • 33751025160 scopus 로고    scopus 로고
    • Mitasiunaite, I., Boulicaut, J.F.: Looking for monotonicity properties of a similarity constraint on sequences. In: SAC 2006, pp. 546-552. ACM, New York (2006)
    • Mitasiunaite, I., Boulicaut, J.F.: Looking for monotonicity properties of a similarity constraint on sequences. In: SAC 2006, pp. 546-552. ACM, New York (2006)
  • 25
    • 34147151231 scopus 로고    scopus 로고
    • Mining minimal distinguishing subsequence patterns with gap constraints
    • Ji, X., Bailey, J., Dong, G.: Mining minimal distinguishing subsequence patterns with gap constraints. Knowl. Inf. Syst. 11(3), 259-286 (2007)
    • (2007) Knowl. Inf. Syst , vol.11 , Issue.3 , pp. 259-286
    • Ji, X.1    Bailey, J.2    Dong, G.3
  • 26
    • 39549090389 scopus 로고    scopus 로고
    • SeqAn an efficient, generic C++ library for sequence analysis
    • Döring, A., Weese, D., Rausch, T., Reinert, K.: SeqAn an efficient, generic C++ library for sequence analysis. BMC Bioinformatics 9, 11 (2008)
    • (2008) BMC Bioinformatics , vol.9 , pp. 11
    • Döring, A.1    Weese, D.2    Rausch, T.3    Reinert, K.4


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