Maximum-Sum Segments
Author:
- 22 April 2016
- book chapter
- Published by Springer Nature
- p. 1242-1244
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Locating Regions in a Sequence under Density ConstraintsSIAM Journal on Computing, 2013
- Searching a Bitstream in Linear Time for the Longest Substring of Any Given DensityAlgorithmica, 2010
- Optimal Algorithms for the Interval Location Problem with Range Constraints on Length and AverageIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2008
- Improved algorithms for themaximum-sums problemsTheoretical Computer Science, 2006
- Optimal algorithms for locating the longest and shortest segments satisfying a sum or an average constraintInformation Processing Letters, 2005
- Maximum-scoring segment setsIEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004
- On the Range Maximum-Sum Segment Query ProblemLecture Notes in Computer Science, 2004
- An Optimal Algorithm for Maximum-Sum Segment and Its Application in BioinformaticsLecture Notes in Computer Science, 2003
- Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysisJournal of Computer and System Sciences, 2002
- Finding the k Shortest PathsSIAM Journal on Computing, 1998