More Efficient Algorithms for Closest String and Substring Problems (Q3586187): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:06, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | More Efficient Algorithms for Closest String and Substring Problems |
scientific article |
Statements
More Efficient Algorithms for Closest String and Substring Problems (English)
0 references
6 September 2010
0 references
closest string
0 references
closest substring
0 references
fixed-parameter algorithm
0 references
approximation algorithms
0 references
