Parallel complexity of signed graphs for gene assembly in ciliates



: Harju T, Li C, Petre I

Publisher: SPRINGER

: 2008

 Soft Computing - A Fusion of Foundations, Methodologies and Applications

: SOFT COMPUTING

: SOFT COMPUT

: 12

: 8

: 731

: 737

: 7

: 1432-7643

DOI: https://doi.org/10.1007/s00500-007-0233-4


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.



Last updated on 14/10/2025 10:08:41 AM