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
Gemini 3 and 200+ AI Models on One Platform Icon
Gemini 3 and 200+ AI Models on One Platform

Access Google's best plus Claude, Llama, and Gemma. Fine-tune and deploy from one console.

Build generative AI apps with Vertex AI. Switch between models without switching platforms.
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