Levenshtein distance (http://en.wikipedia.org/wiki/
Levenshtein_distance) perhaps?
On Apr 10, 10:23 am, kunzmilan kunzmi...@atlas.cz wrote:
On 10 Dub, 07:45, Jing jingai...@gmail.com wrote:
Hey all,
My problem is as follows:
1) I have N strings and all strings has the same length L.
On 10 Dub, 07:45, Jing jingai...@gmail.com wrote:
Hey all,
My problem is as follows:
1) I have N strings and all strings has the same length L.
2) To be simplified, each string is composed by english letters.
How to select a set of M (M N) strings that are most dissimilar?
My
