![]() ![]() ![]() Below is the current version of my global alignment class. The version of SW I am implementing includes an option for gaps in both sequences to open up, so the recurrence relation for each matrix has three options. I also have been told that it is necessary to recalculate the values (instead of just looking them up) but I don't see how that will come up with different numbers. I have my dynamic programming algorithm to build the matrix correctly as far as I can tell, but I am confused on how to do the traceback calculations. ![]() My understanding is that while basically every discussion of dynamic programming I can find has one store the pointers as the matrix is populated, it is faster to instead to re-calculate the previous cells during the traceback step instead. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |