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 >

Categories

Bio-Informatics, Medical, Information Analysis

License

GNU General Public License version 3.0 (GPLv3)

Follow BpMatch

BpMatch Web Site

Other Useful Business Software
Build Data Resilience - Take the Assessment Today Icon
Build Data Resilience - Take the Assessment Today

Can you recover when it matters most? Take this quick assessment to identify gaps and build greater recovery confidence.

Is your recovery strategy as strong as you think? Take this quick self-assessment to check your recovery readiness and gain tailored insights. In only 2 minutes, you'll learn where you fall on the recovery readiness scale.
Take the Assessment
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
Report inappropriate content