Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
From MaRDI portal
Publication:1872726
DOI10.1016/S0022-0000(02)00010-7zbMath1059.68024OpenAlexW2114510609MaRDI QIDQ1872726
Yaw-Ling Lin, Kun-Mao Chao, Tao Jiang
Publication date: 14 May 2003
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0022-0000(02)00010-7
AlgorithmEfficiencyBiomolecular sequence analysisLength constraintMaximum consecutive subsequenceUngapped local alignment
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Protein sequences, DNA sequences (92D20)
Related Items
Finding a maximum-density path in a tree under the weight and length constraints ⋮ On the range maximum-sum segment query problem ⋮ Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics ⋮ The density maximization problem in graphs ⋮ Optimal eviction policies for stochastic address traces ⋮ Randomized algorithm for the sum selection problem ⋮ Cache oblivious algorithms for the RMQ and the RMSQ problems ⋮ Finding maximum sum segments in sequences with uncertainty ⋮ Finding long and similar parts of trajectories ⋮ Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths ⋮ Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence ⋮ Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence ⋮ An improved algorithm for finding a length-constrained maximum-density subtree in a tree ⋮ Optimal algorithms for the average-constrained maximum-sum segment problem ⋮ Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications ⋮ Finding a length-constrained maximum-density path in a tree ⋮ An optimal algorithm for the maximum-density path in a tree ⋮ Improved algorithms for the \(k\) maximum-sums problems ⋮ Algorithms for Problems on Maximum Density Segment ⋮ MINKOWSKI SUM SELECTION AND FINDING ⋮ On locating disjoint segments with maximum sum of densities ⋮ Fast algorithms for the density finding problem ⋮ Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently ⋮ Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraint
Cites Work
