Fast algorithms for the density finding problem (Q1024779): Difference between revisions

@@ Property / describes a project that uses @@
+MAVG
@@ Property / describes a project that uses: MAVG / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-007-9023-8
+Normal rank
@@ Property / OpenAlex ID @@
+W1973155071
@@ Property / OpenAlex ID: W1973155071 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for the Maximum-Density Segment Problem
+Normal rank
@@ Property / cites work @@
+Q4410125
@@ Property / cites work: Q4410125 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications
+Normal rank
@@ Property / cites work @@
+Linear-time algorithm for finding a maximum-density segment of a sequence
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for determining the convex hull of a finite planar set
+Normal rank