Is there an algorithm for maximum text coverage by available substrings?

Question

Algorithms

Good afternoon!
Please tell me, is there an algorithm (or good ideas for implementation) for solving the following problem: there is a line of text (of an indefinite size, in most cases large) and a set of lines (in most cases, quite large). At the output, it is necessary to give a combination of the maximum non- overlapping text coverage by matching substrings from the set, i.e. get a combination in which the number of areas in the text will be minimized for which the corresponding word from the set for "coverage" was not found.

Answer 1

In bioinformatics, such tasks are dealt with. Most likely, the NP problem is complete and there may not be an exact solution.

Answer 2

Variation on the theme of Knuth-Morris-Pratt or Aho-Korasik. Rather the second.