![]() I'll give the output of Hirschberg's algorithm. I believe the two algorithms are supposed to produce the same results, that Hirschberg's algorithm is a more space-efficient implementation of the Needleman-Wunsch algorithm, though the two algorithms below produce slightly different results. I'll be using Gang Li's implementation of these algorithms, available on GitHub. These algorithms can be used to compare any sequences, though they are more often used to compare DNA sequences than impenetrable novels and parodies. ![]() In this post, I'll show how to align two sequences using the sequence alignment algorithms of Needleman-Wunsch and Hirschberg. In my previous post, I illustrated the Levenshtein edit distance by comparing the opening paragraphs of Finnegans Wake by James Joyce and a parody by Adam Roberts.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |