Abstract: This paper aims to fully present a new genetic approach that uses rank distance for solving two known NP complete problems: closest string and closest sub string. We build a genetic ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results