Alexander Schmidt Mathematical methods, programming

Turned out to be a very useful find in case where a LCS needs to be found for very large collections. The following algorithm can be implemented using MapReduce giving a very good Nlogn asymptotic performance:

A New Efficient Algorithm for Computing the Longest Common Subsequence

http://www.google.com/url?sa=t&rct=j&q=&esrc=s&frm=1&source=web&cd=1&cad=rja&ved=0CCYQFjAA&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.63.9182%26rep%3Drep1%26type%3Dpdf&ei=Bst9UOLQKPSGyQGey4CIAg&usg=AFQjCNFK02SuF8LTcM0lV_9eobr2ffLROw

http://www.katsbits.com/tutorials/blender/setting-up-windows-python-path-system-variable.php

http://blogs.technet.com/b/tomshinder/archive/2010/04/01/uag-directaccess-server-deployment-scenarios.aspx