2436 search results - page 300 / 488 » Comonadic Notions of Computation |
260
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
The proofs of major results of Computability Theory like Rice, Rice-Shapiro or Kleene's fixed point theorem hide more information of what is usually expressed in their respec...
191
click to vote
RECOMB
2005
Springer
16 years 6 months ago
2005
Springer
: A series of genome-scale algorithms and high-performance implementations is described and shown to be useful in the genetic analysis of gene transcription. With them it is possib...
152
click to vote
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
In order to apply gene-order rearrangement algorithms to the comparison of genome sequences, Pevzner and Tesler [9] bypass gene finding and ortholog identification, and use the or...
160
click to vote
RECOMB
2003
Springer
16 years 6 months ago
2003
Springer
The correct interpretation of tandem mass spectra is a difficult problem, even when it is limited to scoring peptides against a database. De novo sequencing is considerably harder...
164
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...