Login / Signup
On the Complexity of Rearrangement Problems under the Breakpoint Distance.
Jakub Kovác
Published in:
J. Comput. Biol. (2014)
Keyphrases
</>
np hardness
lower bound
np complete
decision problems
databases
neural network
data mining
distance measure
euclidean distance
distance metric
solving problems
complexity bounds