291 search results - page 4 / 59 » Computing Through Gene Assembly |
IJFCS
2008
13 years 7 months ago
2008
We propose two different ways to simulate Boolean circuits in the framework of ciliate computations, based on the intramolecular and on the intermolecular gene assembly models wit...
GG
2004
Springer
14 years 1 months ago
2004
Springer
that graph transformations provide the right level of abstraction, and useful technical tools for studying gene assembly. On the other hand, the gene assembly process inspires a ne...
BIRTHDAY
2004
Springer
14 years 1 months ago
2004
Springer
del based on (overlap) graphs. The latter is more abstract because the translation of legal strings into overlap graphs is not injective. In this paper we consider and solve the ov...
RECOMB
2008
Springer
14 years 8 months ago
2008
Springer
We introduce the first exact and efficient algorithm for Guig?o et al.'s problem that, given a collection of rooted, binary gene trees and a rooted, binary species tree, deter...
BMCBI
2007
13 years 7 months ago
2007
Background: Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of ...