Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350)
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: Finite automata based algorithms on subsequences and supersequences of degenerate strings |
scientific article; zbMATH DE number 5711878
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finite automata based algorithms on subsequences and supersequences of degenerate strings |
scientific article; zbMATH DE number 5711878 |
Statements
Finite automata based algorithms on subsequences and supersequences of degenerate strings (English)
0 references
25 May 2010
0 references
finite automata
0 references
degenerate strings
0 references
longest common subsequence
0 references
shortest common supersequence
0 references
constrained longest common subsequence
0 references
0.8471182584762573
0 references
0.787872314453125
0 references
0.779170572757721
0 references
0.7714110016822815
0 references
