Chaining of maximal exact matches in graphs (Q6545445)
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 7854977
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chaining of maximal exact matches in graphs |
scientific article; zbMATH DE number 7854977 |
Statements
Chaining of maximal exact matches in graphs (English)
0 references
29 May 2024
0 references
sequence-to-graph alignment
0 references
longest common subsequence
0 references
sparse dynamic programming
0 references
0 references
0 references
0.8395714163780212
0 references
0.763275146484375
0 references
0.7546520233154297
0 references
0.7541686296463013
0 references
0.7539224028587341
0 references
