This is like a similar mathematical problem: There are a set of points on the two dimensional plane. Every point can be represented as (x, y) Now pick up a certain number of points which make they are far away from each other ASAP.
The problem is to define: 1. What is distance of two different points (usually for points on plane, euclidean distance would be the choice) 2. How to measure the closeness of a set of points? many ways, like maximum radius, minimum radius, mean distance, average distance, mean distance& variance of distance, etc... There is no a universal measure, depend on the situation to select a suitable one. Using edition distance to be the distance measure of two strings is fine On Apr 10, 1:45 am, 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 questions are as follows: > > 1) For any two strings, we can calculate the "edition distance" as the > dissimilarity. If there are more than 2, say M, strings, how to > characterize the dissimilarity of the whole set? > > 2) If the first question is well addressed, how to select the best M > string so that the dissimilarity metric is maximized? > > Many thanks! I appreaciate any of your comments! --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
