297 search results - page 31 / 60 » Every Sequence Is Decompressible from a Random One |
BIBE
2005
IEEE
15 years 4 months ago
2005
IEEE
One of the major problems in biological data integration is that many data sources are stored as flat-files, with a variety of different layouts. Integrating data from such sour...
DM
2008
14 years 11 months ago
2008
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
107
click to vote
JSYML
2007
14 years 11 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
104
Voted
ICALP
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. We consider the sequence comparison problem, also known as “hidden pattern” problem, where one searches for a given subsequence in a text (rather than a string unders...
CSB
2003
IEEE
15 years 4 months ago
2003
IEEE
DNA microarrays are a valuable tool for massively parallel DNA-DNA hybridization experiments. Currently, most applications rely on the existence of sequence-specific oligonucleot...