Fast algorithms for the density finding problem (Q1024779)
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: Fast algorithms for the density finding problem |
scientific article; zbMATH DE number 5566001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for the density finding problem |
scientific article; zbMATH DE number 5566001 |
Statements
Fast algorithms for the density finding problem (English)
0 references
17 June 2009
0 references
maximum-density segment problem
0 references
density finding problem
0 references
slope selection problem
0 references
convex hull
0 references
computational geometry
0 references
GC content
0 references
DNA sequence
0 references
bioinformatics
0 references
0 references
0.9357970952987672
0 references
0.9169156551361084
0 references
0.9076679348945618
0 references
