Given a pattern H, i.e. a set of words in a given alphabet A. Let T be a random text of size n generated according to a given probability model. Current version of the program supports Bernoulli model only. The program computes the probability to find at least s (possibly overlapping) occurrences of words from a pattern H in a random text T.
Follow MinSufPref
Other Useful Business Software
Train ML Models With SQL You Already Know
Build and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of MinSufPref!