Longest biased interval and longest non-negative sum interval.
other
Where this comes from
- Record sourced from PubMed, PMID 12835276.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
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. Java code of the algorithm can be found at http://www.csse.monash.edu.au/~lloyd/tildeProgLang/Java2/Biased/. Examples of applications to Plasmodium falciparum genomic DNA can be found at the above URL.
Medical subject headings
- Algorithms
- Models, Statistical
- Pattern Recognition, Automated
- Sequence Alignment
- Sequence Analysis