An improved algorithm for the longest common subsequence problem (Q1762001): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cor.2011.02.026 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2084652256 / rank | |||
Normal rank | |||
Revision as of 02:51, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An improved algorithm for the longest common subsequence problem |
scientific article |
Statements
An improved algorithm for the longest common subsequence problem (English)
0 references
15 November 2012
0 references
longest common subsequence
0 references
LCS
0 references
beam search
0 references
heuristic function
0 references
algorithms
0 references
bioinformatics
0 references
