Journal of Computer and System Sciences - Computational biology 2002
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Linear-time algorithm for finding a maximum-density segment of a sequence
Information Processing Letters
An Optimal Algorithm for the Maximum-Density Segment Problem
SIAM Journal on Computing
Fast and space-efficient location of heavy or dense segments in run-length encoded sequences
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Information Processing Letters
A geometric framework for solving subsequence problems in computational biology efficiently
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Maximum segment sum is back: deriving algorithms for two segment problems with bounded lengths
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Finding a maximum-density path in a tree under the weight and length constraints
Information Processing Letters
Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and Average
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An improved algorithm for finding a length-constrained maximum-density subtree in a tree
Information Processing Letters
An optimal algorithm for the maximum-density path in a tree
Information Processing Letters
Finding long and similar parts of trajectories
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Optimal Randomized Algorithm for the Density Selection Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Information Processing Letters
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Finding long and similar parts of trajectories
Computational Geometry: Theory and Applications
The density maximization problem in graphs
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Disjoint segments with maximum density
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
On locating disjoint segments with maximum sum of densities
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
The density maximization problem in graphs
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We study an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (a"i,w"i) for i=1,...,n and w"i0, a segmentA(i,j) is a consecutive subsequence of A starting with index i and ending with index j. The width of A(i,j) is w(i,j)=@?"i"=