Two algorithms for LCS consecutive suffix alignment (Q2643733)
From MaRDI portal
!
WARNING
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 5183055
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two algorithms for LCS consecutive suffix alignment |
scientific article; zbMATH DE number 5183055 |
Statements
Two algorithms for LCS consecutive suffix alignment (English)
0 references
27 August 2007
0 references
dynamic programming
0 references
longest common subsequence
0 references
match point arithmetic
0 references
incremental algorithms
0 references
0 references
0.9934319257736206
0 references
0.8400868773460388
0 references
0.8340569734573364
0 references
0.8225737810134888
0 references
0.8179821372032166
0 references
