BpMatch is an algorithm that, given 2 strings S and T, compute the maximum coverage of T using only subequence or reversed complemented subsequences of S, of minimum length l.
License
GNU General Public License version 3.0 (GPLv3)Follow BpMatch
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 BpMatch!