1732 search results - page 37 / 347 » Sequences of Level 1, 2, 3, ..., k , .. |
170
click to vote
ISPAN
1997
IEEE
15 years 10 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
178
click to vote
GCB
2003
Springer
15 years 11 months ago
2003
Springer
Clustering of EST data is a method for the non-redundant representation of an organisms transcriptome. During clustering of large amounts of EST data, usually some large clusters ...
185
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: BLAST searches are widely used for sequence alignment. The search results are commonly adopted for various functional and comparative genomics tasks such as annotating...
181
click to vote
COMGEO
2011
ACM
15 years 1 months ago
2011
ACM
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k...
171
click to vote
DAM
1998
15 years 5 months ago
1998
We give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, l − 1, n − 1). The number P(k, l, n) counts noncrossing partitions of {1, 2, . . ...