An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics

DOI10.1007/3-540-45089-0_23zbMath1279.92064OpenAlexW2238365835MaRDI QIDQ3559780

No author found.

Publication date: 7 May 2010

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45089-0_23

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20) Computational methods for problems pertaining to biology (92-08)

Related Items (11)

On the range maximum-sum segment query problem ⋮ Nonparametric estimation of genewise variance for microarray data ⋮ Randomized algorithm for the sum selection problem ⋮ Cache oblivious algorithms for the RMQ and the RMSQ problems ⋮ Modeling association between DNA copy number and gene expression with constrained piecewise linear regression splines ⋮ A two-component \(G\)-prior for variable selection ⋮ Algorithms for finding the weight-constrained \(k\) longest paths in a tree and the length-constrained \(k\) maximum-sum segments of a sequence ⋮ Optimal algorithms for the average-constrained maximum-sum segment problem ⋮ Improved algorithms for the \(k\) maximum-sums problems ⋮ 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

This page was built for publication: An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics