An iterative approach to determining the length of the longest common subsequence of two strings (Q1762882)
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: An iterative approach to determining the length of the longest common subsequence of two strings |
scientific article; zbMATH DE number 2133632
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An iterative approach to determining the length of the longest common subsequence of two strings |
scientific article; zbMATH DE number 2133632 |
Statements
An iterative approach to determining the length of the longest common subsequence of two strings (English)
0 references
11 February 2005
0 references
sequence alignment
0 references
longest common subsequence
0 references
Chvátal-Sankoff constant
0 references
similiarity between biological sequences
0 references
genomics
0 references
0.8330416679382324
0 references
0.8059728741645813
0 references
0.7999473214149475
0 references
