On the hardness of the Consensus String problem.
Amihood AmirHaim ParyentyLiam RodittyPublished in: Inf. Process. Lett. (2013)
Keyphrases
- data structure
- regular expressions
- pattern matching
- string matching
- computational complexity
- directed networks
- edit distance
- phase transition
- np hard
- worst case
- np complete
- multiscale
- case study
- agnostic learning
- real time
- similarity measure
- uniform distribution
- hamming distance
- suffix tree
- np hardness
- clustering ensemble
- consensus clustering
- binary strings
- artificial intelligence