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

You Might Also Like
Easy management of simple and complex projects Icon
Easy management of simple and complex projects

We help different businesses become digital, manage projects, teams, communicate effectively and control tasks online.

Plan more projects with Worksection. Use Gantt chart and Kanban boards to organize your projects, get your team onboard and assign tasks and due dates.
Learn More
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of BpMatch!

Additional Project Details

Operating Systems

Linux, BSD

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