570 search results - page 27 / 114 » On the number of zero-sum subsequences |
BMCBI
2006
13 years 10 months ago
2006
Background: In gene networks, the timing of significant changes in the expression level of each gene may be the most critical information in time course expression profiles. With ...
SPIRE
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
COMBINATORICA
2008
13 years 10 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
SIAMCOMP
2008
13 years 9 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
ICDE
2007
IEEE
14 years 11 months ago
2007
IEEE
In this paper, we propose SPRITE (Selective PRogressive Index Tuning by Examples), a scalable system for text retrieval in a structured P2P network. Under SPRITE, each peer is res...