A1 Refereed original research article in a scientific journal
Parallel complexity of signed graphs for gene assembly in ciliates
Authors: Harju T, Li C, Petre I
Publisher: SPRINGER
Publication year: 2008
Journal:Soft Computing - A Fusion of Foundations, Methodologies and Applications
Journal name in sourceSOFT COMPUTING
Journal acronym: SOFT COMPUT
Volume: 12
Issue: 8
First page : 731
Last page: 737
Number of pages: 7
ISSN: 1432-7643
DOI: https://doi.org/10.1007/s00500-007-0233-4
Abstract
We consider a graph-based model for the study of parallelism in ciliate gene assembly, where a signed graph is associated to each micronuclear gene and the gene assembly is modeled as a graph rewriting process. A natural measure of complexity for gene assembly counts the minimal number of parallel steps needed to reduce the associated signed graph. We investigate the complexity of several classes of the graphs, so far found graphs of parallel complexity up to six. The general problem of whether there exists a finite upper bound for the graph parallel complexity still remains open.
We consider a graph-based model for the study of parallelism in ciliate gene assembly, where a signed graph is associated to each micronuclear gene and the gene assembly is modeled as a graph rewriting process. A natural measure of complexity for gene assembly counts the minimal number of parallel steps needed to reduce the associated signed graph. We investigate the complexity of several classes of the graphs, so far found graphs of parallel complexity up to six. The general problem of whether there exists a finite upper bound for the graph parallel complexity still remains open.
UTU Research Portal