Hirschberg's algorithm to recover full sequence alignments in linear space. Generic header-only implementation which takes a cost function which can be e.g. Longest Common Subsequence (LCS), Needleman-Wunsch, Damerau-Levenshtein, or any other similar dynamic programming algorithm for sequences.
Hirschberg's algorithm to recover full sequence alignments in linear space. Generic header-only implementation which takes a cost function which can be e.g. Longest Common Subsequence (LCS), Needleman-Wunsch, Damerau-Levenshtein, or any other similar dynamic programming algorithm for sequences.
License
goodcleanfun/hirschberg
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Hirschberg's algorithm to recover full sequence alignments in linear space. Generic header-only implementation which takes a cost function which can be e.g. Longest Common Subsequence (LCS), Needleman-Wunsch, Damerau-Levenshtein, or any other similar dynamic programming algorithm for sequences.
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published