Filters








36,620 Hits in 2.8 sec

Complexity theory for splicing systems

Remco Loos, Mitsunori Ogihara
2007 Theoretical Computer Science  
This paper proposes a notion of time complexity in splicing systems.  ...  For a function t from the set of natural numbers to itself, the class of languages with splicing system time complexity t (n) is denoted by SPLTIME[ f (n)].  ...  Acknowledgments The authors thank the anonymous referees for their useful comments and suggestions. The second author thanks Lane Hemaspaandra for stimulating discussions.  ... 
doi:10.1016/j.tcs.2007.06.010 fatcat:ihzkxvanwzeibmilhcj7wn3rxm

Complexity Theory for Splicing Systems [chapter]

Remco Loos, Mitsunori Ogihara
Lecture Notes in Computer Science  
This paper proposes a notion of time complexity in splicing systems.  ...  For a function t from the set of natural numbers to itself, the class of languages with splicing system time complexity t (n) is denoted by SPLTIME[ f (n)].  ...  Acknowledgments The authors thank the anonymous referees for their useful comments and suggestions. The second author thanks Lane Hemaspaandra for stimulating discussions.  ... 
doi:10.1007/978-3-540-73208-2_29 fatcat:csus5xf2erdtjogroc5oy3moke

Page 5752 of Mathematical Reviews Vol. , Issue 97I [page]

1997 Mathematical Reviews  
systems with operations related to splicing.  ...  In general, this paper classifies different models of the above splicing system in terms of their generating power. {For the entire collection see MR 97f:68037.}  ... 

Graph Splicing System [article]

L.Jeganathan, R.Rama
2007 arXiv   pre-print
In this paper, we take a different and a novel approach to splice two graphs and introduce a splicing system for graphs that can be applied to all types of graphs.  ...  The string splicing was introduced by Tom Head which stands as an abstract model for the DNA recombination under the influence of restriction enzymes.  ...  conclusion As graphs are better suited for representing complex structures, a model for splicing the graphs, graph splicing system is introduced, which can be applied to all types of graphs.  ... 
arXiv:cs/0702034v1 fatcat:btroxhywargi7n2gt2vcccjo6q

RNA enzymes for RNA splicing

Andy Newman
2001 Nature  
So, at high enough densities, ǵG* passes through a minimum and begins to increase, a result not predicted by classical theory. This effect is strongest for polydisperse systems.  ...  The idea that a U2-U6 complex could form the active site for the first step of splicing dovetails neatly with earlier findings that the spliceosome is metal-ion-dependent, like several other RNA enzymes  ...  For even Daedalus can think of no way of switching off a real local sound source. David Jones  ... 
doi:10.1038/35099665 pmid:11607017 fatcat:m62ecksx5bea3isaypjcvkhccq

Page 3348 of Mathematical Reviews Vol. , Issue 2001E [page]

2001 Mathematical Reviews  
Summary: “One of the great challenges of complexity theory is the problem of analyzing the dependence of the complexity of Boolean functions on the resources of nondeterminism and randomness.  ...  {For the entire collection see MR 2000j:68008. } 2001¢:68063 68Q05 68Q15 Sauerhoff, M. (D-DORT-FI; Dortmund) An improved hierarchy result for partitioned BDDs. (English summary) Theory Comput.  ... 

Alphabetic Flat Splicing Pure Context-free Grammar Systems

G. Samdanielthompson, N.Gnanamalar David, K. G. Subramanian
2017 Journal of Mathematics and Informatics  
On the other hand, in the study of modelling of distributed complex systems based on language theory, grammar systems were proposed.  ...  Here we introduce a grammar system, called alphabetic flat splicing pure context-free grammar system ‫,)ܵܩܨܥܲܵܨܣ(‬ as a new model of language generation, based on the operation of alphabetic flat splicing  ...  complex systems.  ... 
doi:10.22457/jmi.v7a1 fatcat:bvwxxxu5xfasjbkejltz7hqg5m

Complex analytic realization of links [article]

Walter D. Neumann, Anne Pichon
2006 arXiv   pre-print
We present the complex analytic and principal complex analytic realizability of a link in a 3-manifold M as a tool for understanding the complex structures on the cone C(M).  ...  Acknowledgments: The first author acknowledges the support of the NSF and the NSA for this research.  ...  In section 4 we describe the implications for splice singularities, a class of singularities characterized by their principal analytic link theory.  ... 
arXiv:math/0610348v1 fatcat:6upnnt7v4zf3jozrrfc5gdbge4

Page 1150 of Mathematical Reviews Vol. , Issue 94b [page]

1994 Mathematical Reviews  
Since the basic hypothesis is the sequencing hypothe- sis, the entropy of sequences is explicitly considered and, in view of the complexity of biological systems, the algorithmic informa- tion theory of  ...  Previous work on splicing systems is reviewed and problems are suggested that concern the generative capacities of splicing schemes acting on both linear and circular strings.”  ... 

Page 1160 of Mathematical Reviews Vol. , Issue 98B [page]

1998 Mathematical Reviews  
distributed systems based on splicing.  ...  Distributed splicing systems are introduced, bringing together ideas of splicing, test-tube computing and parallel communicat- ing grammar systems.  ... 

Page 3885 of Mathematical Reviews Vol. , Issue 97F [page]

1997 Mathematical Reviews  
Dong Yang Long (PRC-ZHO-C; Guangzhou) 68Q Theory of computing 97f:68102 68Q50 68Q45 Dassow, Jiirgen (D-MAGC; Magdeburg); Mitrana, Victor (R-BUCHM; Bucharest) Splicing grammar systems.  ...  In this paper the author shows that transferring a def- inition from the theory of iterated function systems (IFS) sheds some new light on simplifying words.  ... 

Diversity suppresses growth

David W. Oxtoby
2001 Nature  
So, at high enough densities, ǵG* passes through a minimum and begins to increase, a result not predicted by classical theory. This effect is strongest for polydisperse systems.  ...  For instance, RNA forms the active site in the ribosome, the complex molecular machine that catalyses protein synthesis.  ... 
doi:10.1038/35099662 pmid:11607016 fatcat:kuf54f7pnfggtd663la3jxvr5q

Page 7285 of Mathematical Reviews Vol. , Issue 98K [page]

1998 Mathematical Reviews  
Summary: “In this paper we investigate computational complex- ity for parallel communicating grammar systems (PCGSs) whose components are context-free grammars.  ...  {For the entire collection see MR 98i:68003.} 98k:68105 68Q50 Bruda, Stefan On the computational complexity of context-free parallel communicating grammar systems.  ... 

Origins of introns based on the definition of exon modules and their conserved interfaces

A. D. G. de Roos
2004 Bioinformatics  
The genome has evolved from a simple RNA based self-replicating system, the RNA world (Gilbert, 1986; Joyce, 2002) to a complex system of multi-exon genes coding for multi-modular proteins.  ...  In this theory, the first exons coded for ancient protein modules from which multi-modular proteins were assembled by means of exon shuffling and recombination.  ...  The evolution of transposons from introns, both able to function as relatively independent functional units, may account for many of the observations attributed to the introns-late theory (Cho and Doolittle  ... 
doi:10.1093/bioinformatics/bth475 pmid:15308547 fatcat:rdj72losrnc7fi33fjybkkjpx4

Page 8881 of Mathematical Reviews Vol. , Issue 2000m [page]

2000 Mathematical Reviews  
Many different variations of these systems are considered: simple H systems, extended H systems, splicing with multiplicities, double splicing systems, splicing of circular strings, distributed H systems  ...  We have exactly the same space-bound complexity classes and hierarchy for bounded-one-sided-error probabilistic computation that we have for nondeterministic computation.  ... 
« Previous Showing results 1 — 15 out of 36,620 results