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
MongoDB Atlas runs apps anywhere Icon
MongoDB Atlas runs apps anywhere

Deploy in 115+ regions with the modern database for every enterprise.

MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
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