An attempt to implement the Needleman-Wunsche algorithm for comparing biological sequences. In some cases, there are several optimal editing paths.
What is common practice in bi-seq data processing tools? Any priority / preference between replace / insert / delete?
If I want to keep several editing paths in memory, is any data structure recommended? Or in general, how to store paths with branches and merges?
Any comments appreciated.
source
share