391 search results - page 35 / 79 » Formal Universes |
92
Voted
BIRTHDAY
2004
Springer
15 years 5 months ago
2004
Springer
Two models for gene assembly in ciliates have been proposed and investigated in the last few years. The DNA manipulations postulated in the two models are very different: one mode...
124
Voted
CTRSA
2005
Springer
15 years 6 months ago
2005
Springer
Undeniable signatures were introduced in 1989 by Chaum and van Antwerpen to limit the self-authenticating property of digital signatures. An extended concept – the convertible un...
92
Voted
LLC
2011
14 years 7 months ago
2011
Computational phonology studies sound patterns in the world’s languages from a computational perspective. This article shows that the similarities between different generative t...
105
click to vote
CPM
2005
Springer
15 years 6 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
127
click to vote
RSA
2010
14 years 11 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...