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
Custom VMs From 1 to 96 vCPUs With 99.95% Uptime
Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of BpMatch!