메뉴 건너뛰기




Volumn , Issue , 2008, Pages

Plagiarism detection using the Levenshtein distance and Smith-Waterman algorithm

Author keywords

[No Author keywords available]

Indexed keywords

ACADEMIC COMMUNITIES; BIOLOGICAL SEQUENCES; DIAGONAL LINE; EFFICIENCY GAINS; INTERNATIONAL CONFERENCES; LEVENSHTEIN DISTANCES; PLAGIARISM DETECTION; PSYCHOLOGICAL FACTORS; SMITH-WATERMAN ALGORITHMS; SPEED UPS;

EID: 52449107305     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICICIC.2008.422     Document Type: Conference Paper
Times cited : (83)

References (11)
  • 1
    • 52449126160 scopus 로고    scopus 로고
    • D.B. Guralnik and Ed. Cleveland, William Collins World Pub, 1976.
    • D.B. Guralnik and Ed. Cleveland, William Collins World Pub, 1976.
  • 2
    • 44949272730 scopus 로고
    • A time-efficient linear-space local similarity algorithm
    • X. Huang and W. Miller, "A time-efficient linear-space local similarity algorithm", Advances in Applied Mathematics, 12:337-357, 1991.
    • (1991) Advances in Applied Mathematics , vol.12 , pp. 337-357
    • Huang, X.1    Miller, W.2
  • 3
    • 0019887799 scopus 로고
    • Identification of common molecular sub-sequences
    • T.F. Smith and M.S. Waterman, "Identification of common molecular sub-sequences", Journal of Molecular Biology, 147:195-197, 1981.
    • (1981) Journal of Molecular Biology , vol.147 , pp. 195-197
    • Smith, T.F.1    Waterman, M.S.2
  • 5
  • 6
    • 0029701640 scopus 로고    scopus 로고
    • YAP3: Improved detection of similarities in computer program and other text
    • PA, pp
    • M. J. Wise, "YAP3: Improved detection of similarities in computer program and other text", 27th SIGCSE, Technical Symposium, PA, pp 130-134, 1996.
    • (1996) 27th SIGCSE, Technical Symposium , pp. 130-134
    • Wise, M.J.1
  • 7
    • 0016518550 scopus 로고
    • A linear space algorithm for computing maximal common subsequences
    • D. S. Hirschberg, "A linear space algorithm for computing maximal common subsequences", Communications of the ACM 18, 1975.
    • (1975) Communications of the ACM , vol.18
    • Hirschberg, D.S.1
  • 8
    • 52449103826 scopus 로고    scopus 로고
    • L. Lancaster. E_ective and E_cient, Plagiarism Detection PhD thesis, School of Computing, Information Systems and Mathematics, South Bank University, 2003.
    • L. Lancaster. E_ective and E_cient, " Plagiarism Detection" PhD thesis, School of Computing, Information Systems and Mathematics, South Bank University, 2003.
  • 9
    • 0038521875 scopus 로고    scopus 로고
    • Non-overlapping local alignments (weighted independent sets of axis-parallel rectangles)
    • V.Bafna, B.Narayanan, and R.Ravi, "Non-overlapping local alignments (weighted independent sets of axis-parallel rectangles)", Discrete Applied Mathematics, 1996.
    • (1996) Discrete Applied Mathematics
    • Bafna, V.1    Narayanan, B.2    Ravi, R.3


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