I am just wondering which specific algorithm does python use to compare two strings. Could it be the Longest common subsequence is the most u
Regards -- *Mob UG: +256 (0) 70 1735800 | NL +31 (0) 6 852 841 38 | Gtalk: jmwebaze | skype: mwebazej | URL: www.astro.rug.nl/~jmwebaze /* Life runs on code */*
-- http://mail.python.org/mailman/listinfo/python-list
