421 search results - page 3 / 85 » String Distances and Uniformities |
121
Voted
GECCO
2009
Springer
15 years 7 months ago
2009
Springer
Given a set of strings S of equal lengths over an alphabet Σ, the closest string problem seeks a string over Σ whose maximum Hamming distance to any of the given strings is as s...
108
Voted
SPIRE
2005
Springer
15 years 8 months ago
2005
Springer
Let A and B be strings with lengths m and n, respectively, over a finite integer alphabet. Two classic string mathing problems are computing the edit distance between A and B, and...
117
Voted
COMBINATORICS
2007
15 years 2 months ago
2007
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...
146
Voted
Publication
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...
100
Voted
ICML
1997
IEEE
16 years 3 months ago
1997
IEEE