Combinatorial models of gene assembly

Authors:
Tero Harju
Affiliations:
Department of Mathematics, University of Turku, Turku, Finland
Venue:
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Year:
2005

Citing 7
Cited 0

Reducing prime graphs and recognizing circle graphs

Combinatorica
Circle graph obstructions

Journal of Combinatorial Theory Series B
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Sorting by reversals is difficult

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
The interlace polynomial: a new graph polynomial

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Solution of a problem in DNA Computing

Theoretical Computer Science
Computation in Living Cells: Gene Assembly in Ciliates (Natural Computing Series)

Computation in Living Cells: Gene Assembly in Ciliates (Natural Computing Series)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider formal recombination operations presented in terms of string, graphs and permutations. These operations are faithful to the molecular operations of gene assembly introduced by Prescott, Ehrenfeucht, and Rozenberg [17]. The results mentioned here on the formal operations are mostly stated in the recent book [8], where one also finds the original references.