Longest biased interval and longest non-negative sum interval.
Bioinformatics
; 19(10): 1294-5, 2003 Jul 01.
Article
em En
| MEDLINE
| ID: mdl-12835276
ABSTRACT
UNLABELLED 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. AVAILABILITY:
Java code of the algorithm can be found at http//www.csse.monash.edu.au/~lloyd/tildeProgLang/Java2/Biased/. SUPPLEMENTARY INFORMATION Examples of applications to Plasmodium falciparum genomic DNA can be found at the above URL.
Buscar no Google
Coleções:
01-internacional
Base de dados:
MEDLINE
Assunto principal:
Algoritmos
/
Reconhecimento Automatizado de Padrão
/
Modelos Estatísticos
/
Alinhamento de Sequência
/
Análise de Sequência
Tipo de estudo:
Risk_factors_studies
Idioma:
En
Ano de publicação:
2003
Tipo de documento:
Article