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
Paessler: Easy to Use With Enterprise Power. Free Trial Icon
Paessler: Easy to Use With Enterprise Power. Free Trial

A low-code dashboard makes monitoring intuitive for any admin, while scripting and custom sensors give experts full control.

You shouldn't have to choose between a monitoring tool that's easy to use and one that's powerful enough for a complex environment. PRTG's low-code interface lets any admin build dashboards, set alerts and monitor devices without scripting, while custom sensors and full API access are there when your team needs deeper control. One platform, no compromise. Download a free 30-day trial now.
Get Free Download
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