BpMatch

License: Free ‎File size: N/A
‎Users Rating: 3.0/5 - ‎1 ‎votes

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.

VERSION HISTORY

  • Version files posted on 2010-06-18
    Several fixes and updates
  • Version N/A posted on 2010-06-18

Program Details