References

Arthur, D. and S. Vassilvitskii, 2007. K-means++: The advantages of careful seeding. Proceedings of the 18th Annual ACM-SIAM Symposium of Discrete Analysis, January 7-9, 2007, New Orleans, LA., USA., pp: 1027-1035.

Butakov, S. and V. Scherbinin, 2009. The toolbox for local and global plagiarism detection. Comput. Educ., 52: 781-788.
CrossRef  |  

Landauer, T.K., P.W. Foltz and D. Laham, 1998. An introduction to latent semantic analysis. Discourse Process., 25: 259-284.
CrossRef  |  

Muth, R. and U. Manber, 1996. Approximate multiple strings search. Proceedings the 7th Annual Symposium on Combinatorial Pattern Matching, June 10-12, 1996, California, USA., pp: 75-86.

Oetsch, J., J. Puhrer, M. Schwengerer and H.Tompits, 2010. he system kato: Detecting cases of plagiarism for answer-set programs. Theory Pract. Logic Program., 10: 759-775.
CrossRef  |  

Parapar, J. and A. Barreiro, 2009. Evaluation of text clustering algorithms with N-gram-based document fingerprints. Proceedings the 31st European Conference on Information Retrieval Research (ECIR), April 6-9, 2009, Toulouse, France, pp: 645-653.

Schleimer, S., D. Wilkerson and A.A. Winnowing, 2003. Local algorithms for document fingerprinting. Proceedings of the ACM Special Interest Group on Management of Data, June 9-12, 2003, San Diego, USA., pp: 76-85.

Wise, M.J., 1996. YAP3: Improved detection of similarities in computer program and other texts. Proceedings of the 27th ACM Special Interest Group on Computer Science Education, February 15-17, 1996, Philadelphia, USA., pp: 130-134.