I am trying to come up with an algorithm with which I can count the total number of optimal paths for 2 given strings in case of global alignment processing using a dynamic programming table.
Since larger sequences can have numerous optimal paths, is there a more efficient way of performing this without having to specifically traceback on each possible optimal path and count them manually?
Aucun commentaire:
Enregistrer un commentaire