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.

Project Activity

See All Activity >

Follow MinSufPref

MinSufPref Web Site

Other Useful Business Software
Train ML Models With SQL You Already Know Icon
Train ML Models With SQL You Already Know

BigQuery automates data prep, analysis, and predictions with built-in AI assistance.

Build and deploy ML models using familiar SQL. Automate data prep with built-in Gemini. Query 1 TB and store 10 GB free monthly.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of MinSufPref!

Additional Project Details

Registered

2025-06-29