We design a new, fast algorithm for agnostically learning univariate probability distributions
whose densities are well-approximated by piecewise polynomial functions. Let ƒ be the …

Motivation: Determining the methylation state of regions with high copy numbers is
challenging for second-generation sequencing, because the read length is insufficient to …

We generalize a problem of finding maximum-scoring segment sets, previously studied by
Csűrös (IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2004, 1, 139 …

Many fundamental questions concerning the emergence and subsequent evolution of
eukaryotic exon–intron organization are still unsettled. Genome-scale comparative studies …

Genome data are increasingly important in the computational identification of novel
regulatory non-coding RNAs (ncRNAs). However, most ncRNA gene-finders are either …

A rectangle blanket is a set of non-overlap** axis-aligned rectangles, used to
approximately represent the two-dimensional image of a shape. The use of a rectangle …

Given a sequence, the problem studied in this paper is to find a set of k disjoint continuous
subsequences such that the total sum of all elements in the set is maximized. This problem …

Given a sequence of length n, the problem studied in this paper is to find a set of k disjoint
subsequences of consecutive elements such that the total sum of all elements in the set is …

Given an array AA containing arbitrary (positive and negative) numbers, we consider the
problem of supporting range maximum-sum segment queries on AA: ie, given an arbitrary …

In many bioinformatics applications the task is to identify biologically significant locations in
an individual genome. In our work, we are interested in finding high-density clusters of such …