longest common subsequence problem
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:application |
DNA sequence analysis
version control systems file comparison |
| gptkbp:category |
NP-hard (for more than two sequences)
P (for two sequences) |
| gptkbp:complexity |
O(mn) time
O(mn) space |
| gptkbp:field |
computer science
bioinformatics string algorithms |
| gptkbp:firstDescribed |
1970s
|
| https://www.w3.org/2000/01/rdf-schema#label |
longest common subsequence problem
|
| gptkbp:input |
two sequences
|
| gptkbp:output |
longest sequence present as subsequence in both inputs
|
| gptkbp:relatedTo |
dynamic programming
edit distance sequence alignment shortest common supersequence problem |
| gptkbp:solvedBy |
gptkb:Hirschberg's_algorithm
dynamic programming algorithm |
| gptkbp:bfsParent |
gptkb:Chvátal–Sankoff_constants
|
| gptkbp:bfsLayer |
7
|