Closest Substring Problems with Small Distances (Q3395036)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5597433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Closest Substring Problems with Small Distances |
scientific article; zbMATH DE number 5597433 |
Statements
Closest Substring Problems with Small Distances (English)
0 references
20 August 2009
0 references
closest substring
0 references
consensus pattern
0 references
parameterized complexity
0 references
fixed-parameter tractability
0 references
computational complexity
0 references
0.903163492679596
0 references
0.8991408348083496
0 references
0.877383828163147
0 references
0.8757354021072388
0 references
