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
Cut Data Warehouse Costs by 54%
BigQuery delivers 54% lower TCO with exabyte scale and flexible pricing. Free migration tools handle the SQL translation automatically.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of BpMatch!