Algorithms for Computing the Longest Parameterized Common Subsequence (Q3506928)
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 5289258
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for Computing the Longest Parameterized Common Subsequence |
scientific article; zbMATH DE number 5289258 |
Statements
Algorithms for Computing the Longest Parameterized Common Subsequence (English)
0 references
17 June 2008
0 references
0.8463019728660583
0 references
0.8449552655220032
0 references
0.8399137258529663
0 references
0.8334852457046509
0 references
0.8256662487983704
0 references
