Performance analysis of some simple heuristics for computing longest common subsequences (Q1336959)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Performance analysis of some simple heuristics for computing longest common subsequences |
scientific article; zbMATH DE number 672033
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Performance analysis of some simple heuristics for computing longest common subsequences |
scientific article; zbMATH DE number 672033 |
Statements
Performance analysis of some simple heuristics for computing longest common subsequences (English)
0 references
27 August 1995
0 references
longest common subsequence
0 references
scan algorithms
0 references
