Generation of regular expressions

A method for obtaining a regular expression, comprising:

• receiving a first plurality of text strings containing at least one of a malignant text string and a benign text string;
• partitioning the first plurality of text strings into a plurality of substrings;
• generating a second plurality of text strings that comprises a second text string of one or more tokens that are chosen from a predefined regular expression and a substring of the plurality of substrings;
• and
• iteratively updating the second plurality of text strings by computing a respective score for each text string in the second plurality of text strings depending on how the respective text string matches at least one of the malignant text string and the benign text string, and replacing a token in the respective text string with a candidate token that increases a matching level with the benign text string based on the respective score;
• and
• selecting, based on the computed scores associated with the second plurality of text strings, a third text string as a first regular expression from the updated second plurality of text strings.

A computer-readable non-transitory storage medium storing a plurality of processor-executable instructions for obtaining a regular expression, the instructions being issuable by a processor to:

• receive a first plurality of text strings containing at least one of a malignant text string and a benign text string;
• partition the first plurality of text strings into a plurality of substrings;
• generate a second plurality of text strings that comprises a second text string of one or more tokens that are chosen from a predefined regular expression and a substring of the plurality of substrings;
• and
• iteratively update the second plurality of text strings by computing a respective score for each text string in the second plurality of text strings depending on how the respective text string matches at least one of the malignant text string and the benign text string, and replacing a token in the respective text string with a candidate token that increases a matching level with the benign text string based on the respective score;
• and
• select, based on the computed scores associated with the second plurality of text strings, a third text string as a first regular expression from the updated second plurality of text strings.