Longest biased interval and longest non-negative sum interval

被引：24

作者：

Allison, L ^{[1
]}

机构：

[1] Monash Univ, Sch Comp Sci & Software Engn, Clayton, Vic 3800, Australia

来源：

BIOINFORMATICS | 2003年 / 19卷 / 10期

关键词：

D O I：

10.1093/bioinformatics/btg135

中图分类号：

Q5 [生物化学];

学科分类号：

071010 ; 081704 ;

摘要：

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.

引用

页码：1294 / 1295

页数：2

共 3 条

[1]

Bentley J., 1986, PROGRAMMING PEARLS, VSecond

[2] Genome sequence of the human malaria parasite Plasmodium falciparum [J].

Gardner, MJ ;

Hall, N ;

Fung, E ;

White, O ;

Berriman, M ;

Hyman, RW ;

Carlton, JM ;

Pain, A ;

Nelson, KE ;

Bowman, S ;

Paulsen, IT ;

James, K ;

Eisen, JA ;

Rutherford, K ;

Salzberg, SL ;

Craig, A ;

Kyes, S ;

Chan, MS ;

Nene, V ;

Shallom, SJ ;

Suh, B ;

Peterson, J ;

Angiuoli, S ;

Pertea, M ;

Allen, J ;

Selengut, J ;

Haft, D ;

Mather, MW ;

Vaidya, AB ;

Martin, DMA ;

Fairlamb, AH ;

Fraunholz, MJ ;

Roos, DS ;

Ralph, SA ;

McFadden, GI ;

Cummings, LM ;

Subramanian, GM ;

Mungall, C ;

Venter, JC ;

Carucci, DJ ;

Hoffman, SL ;

Newbold, C ;

Davis, RW ;

Fraser, CM ;

Barrell, B .

NATURE, 2002, 419 (6906) :498-511

[3]

Ruzzo W L, 1999, Proc Int Conf Intell Syst Mol Biol, P234

← 1 →