Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265)
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: Efficient algorithms for consensus string problems minimizing both distance sum and radius |
scientific article; zbMATH DE number 5955884
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for consensus string problems minimizing both distance sum and radius |
scientific article; zbMATH DE number 5955884 |
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
0.89987373
0 references
0.8779756
0 references
0 references
0.87334377
0 references
0.8697805
0 references
0.8673937
0 references
0.8673804
0 references
0.86399937
0 references
