More Efficient Algorithms for Closest String and Substring Problems (Q3586187): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401496743 |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 10:04, 14 March 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