Tight Hardness Results for Consensus Problems on Circular Strings and Time Series

SIAM JOURNAL ON DISCRETE MATHEMATICS, pp. 1854-1883, 2020.

Cited by: 11|Views11
EI

Abstract:

Consensus problems for strings and sequences appear in numerous application contexts, ranging from bioinformatics to data mining to machine learning. Closing some gaps in the literature, we show that several fundamental problems in this context are NP- and W[1]-hard and that the known (including some brute-force) algorithms are close to o...More

Code:

Data:

Your rating :
0

 

Tags
Comments