Alignment and Distribution is NOT (Always) NP-Hard.
Vincent BoudetFabrice RastelloYves RobertPublished in: ICPADS (1998)
Keyphrases
- np hard
- optimal solution
- approximation algorithms
- np complete
- closely related
- linear programming
- special case
- spatial distribution
- scheduling problem
- data mining
- sequence alignment
- lower bound
- machine learning
- pairwise
- probability distribution
- computational complexity
- search algorithm
- training data
- random variables
- image sequences
- data distribution
- artificial intelligence
- uniformly distributed
- real time
- computationally challenging