Longest biased interval and longest non-negative sum interval.
Described is an algorithm to find the longest interval having at least a specified minimum bias in a sequence of characters (bases, amino acids), e.g. 'at least 0.95 (A+T)-rich'. It is based on an algorithm to find the longest interval having a non-negative sum in a sequence of positive and negative numbers. In practice, it runs in linear time; this can be guaranteed if the bias is rational.


BACKGROUND
Java code of the algorithm can be found at http://www.csse.monash.edu.au/~lloyd/tildeProgLang/Java2/Biased/.


BACKGROUND
Examples of applications to Plasmodium falciparum genomic DNA can be found at the above URL.
Allison
Lloyd
L
School of Computer Science and Software Engineering, Monash University, Clayton, Victoria, Australia 3800. lloyd@bruce.cs.monash.edu.au
D000465:Algorithms; D015233:Models, Statistical; D010363:Pattern Recognition, Automated; D016415:Sequence Alignment / Q000379:methods*; D017421:Sequence Analysis / Q000379:methods*