> i would like to write a piece of code to help me to align some sequence > of words and suggest me the ordered common subwords of them Im not sure what you want, but in case you are guy who knows how quicksort and Djikstra algorithms work :) and wants to find out more.
There are many algorithms out there, discovered on "Text algorithms" univesity course. The first one does not directly solve your problem - "edit distance" (Levenshtein distance) http://en.wikipedia.org/wiki/Levenshtein_distance I mention it here only because it is simple and shows basic idea of Dynamic Programming http://en.wikipedia.org/wiki/Dynamic_programming If you scroll down you'll see "Longest common subsequence problem" with implementation in Python for 2 sequences. If you dont understand how it works just look into "edit distance" idea and see it is exactly the same algorithm with changed rules. Oleg -- http://mail.python.org/mailman/listinfo/python-list
