On locating disjoint segments with maximum sum of densities (Q1024216): Difference between revisions

@@ Property / OpenAlex ID @@
+W2020758113
@@ Property / OpenAlex ID: W2020758113 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms for finding disjoint subsequences with extremal densities
+Normal rank
@@ Property / cites work @@
+Q3602889
@@ Property / cites work: Q3602889 / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Science – ICCS 2005
@@ Property / cites work: Computational Science – ICCS 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+An Optimal Algorithm for the Maximum-Density Segment Problem
+Normal rank
@@ Property / cites work @@
+Mining optimized association rules for numeric attributes
+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