2489 search results - page 34 / 498 » On the Subgroup Distance Problem |
134
Voted
JDA
2007
15 years 21 days ago
2007
In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum 3 i=1 d(G, Gi...
84
Voted
TCS
2002
15 years 14 days ago
2002
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...
126
Voted
CORR
2011
Springer
14 years 4 months ago
2011
Springer
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
85
Voted
CORR
2004
Springer
15 years 20 days ago
2004
Springer
Sorting by reversals is an important problem in inferring the evolutionary relationship between two genomes. The problem of sorting unsigned permutation has been proven to be NP-ha...
129
Voted
NAR
2011
14 years 3 months ago
2011
We present the relational database EDULISS (EDinburgh University Ligand Selection System), which stores structural, physicochemical and pharmacophoric properties of small molecule...