메뉴 건너뛰기




Volumn , Issue , 2008, Pages 520-525

Use of text syntactical structures in detection of document duplicates

Author keywords

[No Author keywords available]

Indexed keywords

ALIGNMENT; BIOINFORMATICS; COMPUTATIONAL LINGUISTICS; INFORMATION THEORY; PLASMA GUNS; TEXT PROCESSING; WORD PROCESSING;

EID: 62949125921     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDIM.2008.4746719     Document Type: Conference Paper
Times cited : (26)

References (23)
  • 1
    • 62949187775 scopus 로고    scopus 로고
    • A. Singhal, Modern Information Retrieval: A Brief Overview, Google, Inc., IEEE, 2001.
    • A. Singhal, "Modern Information Retrieval: A Brief Overview", Google, Inc., IEEE, 2001.
  • 2
    • 84964528874 scopus 로고    scopus 로고
    • L. Bergroth, H. Hakonen and T. Taita, A Survey of Longest Common Subsequence Algorithms, In String Processing and Information Retrieval, 7th. International Symposium on, 27-29 Sept. 2000., pp. 39-48.
    • L. Bergroth, H. Hakonen and T. Taita, "A Survey of Longest Common Subsequence Algorithms", In String Processing and Information Retrieval, 7th. International Symposium on, 27-29 Sept. 2000., pp. 39-48.
  • 4
    • 0025183708 scopus 로고
    • Basic Local Alignment Search Tool
    • Academic Press Limited
    • S. F. Altschul, W. Gish, W. Miller, E. W. Myers and D. J. Lipman, "Basic Local Alignment Search Tool", J. Mol. Biol. Vol.215, Academic Press Limited, 1990, pp. 403-410.
    • (1990) J. Mol. Biol , vol.215 , pp. 403-410
    • Altschul, S.F.1    Gish, W.2    Miller, W.3    Myers, E.W.4    Lipman, D.J.5
  • 5
    • 12244307876 scopus 로고    scopus 로고
    • A fast algorithm for computing a longest common increasing subsequence
    • Elsevier B.V
    • I. Yang, C. Huang and K. Chao, "A fast algorithm for computing a longest common increasing subsequence", Information Processing Letters, Vol.93(5), Elsevier B.V., 2004, pp. 249-253.
    • (2004) Information Processing Letters , vol.93 , Issue.5 , pp. 249-253
    • Yang, I.1    Huang, C.2    Chao, K.3
  • 6
    • 62949222035 scopus 로고    scopus 로고
    • Local Alignment: Smith-Waterman algorithm
    • Arizona State University
    • Baral, C., Local Alignment: Smith-Waterman algorithm, CSE 591: Computational Molecular Biology Course, Arizona State University, 2004.
    • (2004) Computational Molecular Biology Course , vol.CSE 591
    • Baral, C.1
  • 7
    • 34250698372 scopus 로고    scopus 로고
    • A Dual-method Model for Copy Detection
    • Y. Liu and L. Liang, "A Dual-method Model for Copy Detection", IEEE, IAT Workshops, 2006, pp. 634-7.
    • (2006) IEEE, IAT Workshops , pp. 634-637
    • Liu, Y.1    Liang, L.2
  • 19
    • 0033697960 scopus 로고    scopus 로고
    • Copy Detection Systems for Digital Documents
    • Washington, DC, USA, May
    • D. M. Campbell, W. R. Chen and R. D. Smith, "Copy Detection Systems for Digital Documents", IEEE, Washington, DC, USA, May, 2000, pp. 78-88.
    • (2000) IEEE , pp. 78-88
    • Campbell, D.M.1    Chen, W.R.2    Smith, R.D.3
  • 20
    • 0042096783 scopus 로고
    • Improvements in Part-of-Speech Tagging With an Application To German
    • H. Schmid, "Improvements in Part-of-Speech Tagging With an Application To German", EACL SIGDAT workshop, in Dubai (UAE), 1995.
    • (1995) EACL SIGDAT workshop, in Dubai (UAE)
    • Schmid, H.1
  • 21
    • 0000329809 scopus 로고
    • General Methods of Sequence Comparison
    • M. S. Waterman, "General Methods of Sequence Comparison", Bull. Math. Biol.Vol(46), 1984, pp. 473-500.
    • (1984) Bull. Math. Biol.Vol(46) , pp. 473-500
    • Waterman, M.S.1
  • 23
    • 13444259727 scopus 로고    scopus 로고
    • K. A Kazuaki, Techniques of document clustering: A review, Lib. & Info. Sci. J., Mita Press, Japan, 2003, pp.33-75.
    • K. A Kazuaki, "Techniques of document clustering: A review", Lib. & Info. Sci. J., Mita Press, Japan, 2003, pp.33-75.


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