Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > Simple Operations for Gene Ass...

Simple Operations for Gene Assembly

Tero Harju, Ion Petre, Vladimir Rogojin, Grzegorz Rozenberg, Simple Operations for Gene Assembly. In: Proceedings of the 11th International Meeting on DNA-based computers, Lecture Notes in Computer Science 3892, 96–111, Springer, 2006.

Abstract:

The intramolecular model for gene assembly in ciliates considers three operations, $mld$, $mhi$, and $mdlad$ that can assemble any gene pattern through folding and recombination: the molecule is folded so that two occurrences of a pointer (short nucleotide sequence) get aligned and then the sequence is rearranged through recombination of pointers. In general, the sequence rearranged by one operation can be arbitrarily long and consist of many coding and non-coding blocks. We consider in this paper some simpler variants of the three operations, where only one coding block is rearranged at a time. We characterize in this paper the gene patterns that can be assembled through these variants. Our characterization is in terms of signed permutations and dependency graphs. Interestingly, we show that simple assemblies possess rather involved properties: a gene pattern may have both successful and unsuccessful assemblies and also more than one successful assembling strategy.

Files:

Full publication in PDF-format

BibTeX entry:

@INPROCEEDINGS{inpHaPeRoRo06a,
  title = {Simple Operations for Gene Assembly},
  booktitle = {Proceedings of the 11th International Meeting on DNA-based computers},
  author = {Harju, Tero and Petre, Ion and Rogojin, Vladimir and Rozenberg, Grzegorz},
  volume = {3892},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  pages = {96–111},
  year = {2006},
}

Belongs to TUCS Research Unit(s): Computational Biomodeling Laboratory (Combio Lab)

Publication Forum rating of this publication: level 1

Edit publication