Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima (Q4946707)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1422763
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima |
scientific article; zbMATH DE number 1422763 |
Statements
Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima (English)
0 references
8 November 2000
0 references
longest common subsequence
0 references
dynamic programming
0 references
geometric maxima
0 references
computational geometry
0 references
0.8440678715705872
0 references
0.8374587893486023
0 references
0.836821436882019
0 references
