In this paper we approach several decision and counting problems related to partial words, from a computational point of view. First we show that finding a full word that is not compatible with any word from a given list of partial words, all having the same length, is NP-complete; from this we derive that counting the number of words that are compatible with at least one word from a given list of partial words, all having the same length, is #P-complete. We continue by showing that some other related problems are also #P-complete; from these we mention here only two: counting all the distinct full words of a given length compatible with at least one factor of the given partial word, and counting all the distinct squares compatible with at least a factor of a given partial word. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Manea, F., & Tiseanu, C. (2010). Hard counting problems for partial words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6031 LNCS, pp. 426–438). https://doi.org/10.1007/978-3-642-13089-2_36
Mendeley helps you to discover research relevant for your work.