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
Level Up Your Cyber Defense with External Threat Management
Move beyond alerts. Gain full visibility, context, and control over your external attack surface to stay ahead of every threat.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of BpMatch!