Fast algorithms for the density finding problem (Q1024779): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An Optimal Algorithm for the Maximum-Density Segment Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4410125 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear-time algorithm for finding a maximum-density segment of a sequence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3651735 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank | |||
Normal rank |
Latest revision as of 16:54, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Fast algorithms for the density finding problem |
scientific article |
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