4112 search results - page 71 / 823 » Efficient Algorithms for the Spoonerism Problem |
118
click to vote
SIAMCOMP
2008
15 years 3 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...
165
click to vote
WIOPT
2010
IEEE
15 years 1 months ago
2010
IEEE
Scheduling of transmissions is one of the most fundamental problems in the context of wireless networks. In this article, we consider the problem of computing power efficient sched...
239
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
192
click to vote
BMCBI
2011
14 years 7 months ago
2011
Background: Pairwise sequence alignment methods are widely used in biological research. The increasing number of sequences is perceived as one of the upcoming challenges for seque...
152
click to vote
BMCBI
2010
15 years 4 months ago
2010
Background: In recent years, the demand for computational power in computational biology has increased due to rapidly growing data sets from microarray and other high-throughput t...