Sign in
Computing the Tandem Duplication Distance is NP-Hard.
Manuel Lafond
Binhai Zhu
Peng Zou
Published in:
SIAM J. Discret. Math. (2022)
Keyphrases
</>
np hard
special case
optimal solution
scheduling problem
distance measure
minimum cost
neural network
computational complexity
lower bound
distance metric
worst case
approximation algorithms
decision problems
euclidean distance
closely related
distance function
np complete
database
databases