Sciweavers

1090 search results - page 35 / 218
» The Equivalence between Biology and Computation
Sort
View
RECOMB
2003
Springer
16 years 29 days ago
Accurate detection of very sparse sequence motifs
Protein sequence alignments are more reliable the shorter the evolutionary distance. Here, we align distantly related proteins using many closely spaced intermediate sequences as ...
Andreas Heger, Michael Lappe, Liisa Holm
ISAAC
2004
Springer
88views Algorithms» more  ISAAC 2004»
15 years 6 months ago
On the Range Maximum-Sum Segment Query Problem
The range minimum query problem, RMQ for short, is to preprocess a sequence of real numbers A[1 . . . n] for subsequent queries of the form: “Given indices i, j, what is the ind...
Kuan-Yu Chen, Kun-Mao Chao
109
Voted
RECOMB
2010
Springer
14 years 10 months ago
Novel Definition and Algorithm for Chaining Fragments with Proportional Overlaps
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
Raluca Uricaru, Alban Mancheron, Eric Rivals
RTA
2010
Springer
15 years 4 months ago
Simulation in the Call-by-Need Lambda-Calculus with letrec
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
Manfred Schmidt-Schauß, David Sabel, Elena M...
106
Voted
CIBCB
2008
IEEE
15 years 2 months ago
Network motifs in context: An exploration of the evolution of oscillatory dynamics in transcriptional networks
The concept of a network motif--a small set of interacting genes which produce a predictable behaviour at the network level--has attracted considerable attention amongst network an...
Jennifer Hallinan, Anil Wipat