Multiple Alignment, Communication Cost, and Graph Matching (Q4037677)
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 168993
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiple Alignment, Communication Cost, and Graph Matching |
scientific article; zbMATH DE number 168993 |
Statements
Multiple Alignment, Communication Cost, and Graph Matching (English)
0 references
16 May 1993
0 references
biological sequences
0 references
approximation algorithms
0 references
sequence alignment
0 references
maximum matching
0 references
dynamic programming
0 references
0.8931998
0 references
0.87766236
0 references
0.8748419
0 references
0.87278324
0 references
0.86371785
0 references
0.86272997
0 references
0.8564139
0 references
0.85482717
0 references
