Pages that link to "Item:Q1776373"
From MaRDI portal
The following pages link to Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications (Q1776373):
Displaying 16 items.
- The density maximization problem in graphs (Q386420) (← links)
- Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths (Q476312) (← links)
- Searching a bitstream in linear time for the longest substring of any given density (Q644795) (← links)
- Finding long and similar parts of trajectories (Q654283) (← links)
- Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics (Q865758) (← links)
- Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence (Q955012) (← links)
- An improved algorithm for finding a length-constrained maximum-density subtree in a tree (Q975556) (← links)
- An optimal algorithm for the maximum-density path in a tree (Q989545) (← links)
- On locating disjoint segments with maximum sum of densities (Q1024216) (← links)
- Fast algorithms for the density finding problem (Q1024779) (← links)
- Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently (Q1028588) (← links)
- Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint (Q1044737) (← links)
- Finding a maximum-density path in a tree under the weight and length constraints (Q2380075) (← links)
- Algorithms for Problems on Maximum Density Segment (Q2795931) (← links)
- MINKOWSKI SUM SELECTION AND FINDING (Q3089093) (← links)
- Calculating a linear-time solution to the densest-segment problem (Q5371958) (← links)
