consecutive subsequence

JCSS
2002

95views more JCSS 2002»

Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis

13 years 11 months ago

Download www.csie.ntu.edu.tw

We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U; find a consecu...

Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao

claim paper

Read More »

click to vote

CORR
2002
Springer

78views Education» more CORR 2002»

Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications

13 years 11 months ago

Download www.csie.ntu.edu.tw

an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...

Michael H. Goldwasser, Ming-Yang Kao, Hsueh-I Lu

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers