170 search results - page 1 / 34 » An Efficient Algorithm for Identifying the Most Contributory... |
DAWAK
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Detecting repeated portions of strings has important applications to many areas of study including data compression and computational biology. This paper defines and pres...
RECOMB
2006
Springer
14 years 11 months ago
2006
Springer
We study the problem of enumerating substrings that are common amongst genomes that share evolutionary descent. For example, one might want to enumerate all identical (therefore co...
BMCBI
2007
13 years 11 months ago
2007
Background: Sequence comparison faces new challenges today, with many complete genomes and large libraries of transcripts known. Gene annotation pipelines match these sequences in...
SIAMCOMP
2008
13 years 10 months ago
2008
We study two pattern matching problems that are motivated by applications in computational biology. In the Closest Substring problem k strings s1, . . ., sk are given, and the tas...
PVLDB
2010
13 years 5 months ago
2010
Top-k queries are widely applied for retrieving a ranked set of the k most interesting objects based on the individual user preferences. As an example, in online marketplaces, cus...