Maximum-Average Segments
Author:
- 22 April 2016
- book chapter
- Published by Springer Nature
- p. 1241-1242
Abstract
No abstract availableKeywords
This publication has 17 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
- Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applicationsJournal of Computer and System Sciences, 2005
- Disjoint Segments with Maximum DensityLecture Notes in Computer Science, 2005
- Fast Algorithms for Finding Disjoint Subsequences with Extremal DensitiesLecture Notes in Computer Science, 2005
- An Optimal Algorithm for the Maximum-Density Segment ProblemSIAM Journal on Computing, 2005
- Linear-time algorithm for finding a maximum-density segment of a sequenceInformation Processing Letters, 2003
- A new approach to sequence comparison: normalized sequence alignmentBioinformatics, 2001
- Mining Optimized Association Rules for Numeric AttributesJournal of Computer and System Sciences, 1999