Pages that link to "Item:Q3559780"
From MaRDI portal
The following pages link to An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics (Q3559780):
Displaying 11 items.
- A two-component \(G\)-prior for variable selection (Q516468) (← links)
- Nonparametric estimation of genewise variance for microarray data (Q605925) (← links)
- Cache oblivious algorithms for the RMQ and the RMSQ problems (Q626901) (← links)
- Randomized algorithm for the sum selection problem (Q884471) (← 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)
- Optimal algorithms for the average-constrained maximum-sum segment problem (Q976064) (← 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)
- On the range maximum-sum segment query problem (Q2384388) (← links)
- Modeling association between DNA copy number and gene expression with constrained piecewise linear regression splines (Q2443145) (← links)
- Improved algorithms for the \(k\) maximum-sums problems (Q2508973) (← links)
