More Efficient Algorithms for Closest String and Substring Problems (Q3586187): Difference between revisions
From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401496743 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/080739069 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2044713370 / rank | |||
Normal rank | |||
Latest revision as of 14:22, 19 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
