Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:application |
DNA sequence analysis
sequence alignment |
| gptkbp:basedOn |
divide and conquer
|
| gptkbp:complexity |
O(mn) time
|
| gptkbp:designedBy |
gptkb:Dan_Hirschberg
|
| gptkbp:field |
computer science
bioinformatics |
| https://www.w3.org/2000/01/rdf-schema#label |
Hirschberg's algorithm
|
| gptkbp:improves |
dynamic programming
|
| gptkbp:introducedIn |
1975
|
| gptkbp:relatedTo |
gptkb:Smith–Waterman_algorithm
gptkb:Needleman–Wunsch_algorithm |
| gptkbp:spaceComplexity |
O(min(m, n))
|
| gptkbp:usedFor |
solving the longest common subsequence problem
|
| gptkbp:bfsParent |
gptkb:Michael_Hirschberg
|
| gptkbp:bfsLayer |
6
|