Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:33, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for consensus string problems minimizing both distance sum and radius |
scientific article |
Statements
Efficient algorithms for consensus string problems minimizing both distance sum and radius (English)
0 references
10 October 2011
0 references
consensus strings
0 references
multiple alignments
0 references
distance sum
0 references
radius
0 references
