Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics (Q865758): Difference between revisions

@@ Property / OpenAlex ID @@
+W2146968241
@@ Property / OpenAlex ID: W2146968241 / 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 @@
+Finding a length-constrained maximum-density path in a tree
+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 @@
+An efficient algorithm for the length-constrained heaviest path problem on a tree
+Normal rank