Finding a length-constrained maximum-density path in a tree (Q1781798): Difference between revisions

@@ 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/s10878-005-6853-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2105089535
@@ Property / OpenAlex ID: W2105089535 / rank @@
+Normal rank
@@ Property / cites work @@
+On computing all suboptimal alignments
@@ Property / cites work: On computing all suboptimal alignments / rank @@
+Normal rank
@@ Property / cites work @@
+Q4410125
@@ Property / cites work: Q4410125 / rank @@
+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 @@
+An efficient algorithm for the length-constrained heaviest path problem on a tree
+Normal rank