h***n
发帖数: 276 | 1 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 dissi
milarity. 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 | M*****a
发帖数: 2054 | 2 use cluster algorithm
dissi
the
string
solu
【在 h***n 的大作中提到】
: 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 dissi
: milarity. 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
|
|
