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.

Project Activity

See All Activity >

License

GNU General Public License version 3.0 (GPLv3)

Follow BpMatch

BpMatch Web Site

Other Useful Business Software
Custom VMs From 1 to 96 vCPUs With 99.95% Uptime Icon
Custom VMs From 1 to 96 vCPUs With 99.95% Uptime

General-purpose, compute-optimized, or GPU/TPU-accelerated. Built to your exact specs.

Live migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
Start Free
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of BpMatch!

Additional Project Details

Operating Systems

BSD, Linux

Languages

English

Intended Audience

Healthcare Industry, Science/Research

User Interface

Command-line

Programming Language

C++

Related Categories

C++ Bio-Informatics Software, C++ Medical Software, C++ Information Analysis Software

Registered

2003-03-26