Sciweavers

CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 3 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
DNA
2007
Springer
123views Bioinformatics» more  DNA 2007»
13 years 9 months ago
Equivalence in Template-Guided Recombination
We consider theoretical properties of the template-guided recombination operation. In particular, we consider the decidability of whether two sets of templates are equivalent, that...
Michael Domaratzki