The following pages link to Ion Petre (Q223821):
Displaying 50 items.
- Complexity of model checking for reaction systems (Q264544) (← links)
- Dependency graphs and mass conservation in reaction systems (Q496028) (← links)
- Complexity-preserving simulations among three variants of accepting networks of evolutionary processors (Q537856) (← links)
- Three models for gene assembly in ciliates: a comparison (Q632507) (← links)
- Characterizing the micronuclear gene patterns in ciliates (Q699814) (← links)
- Simple gene assembly as a rewriting of directed overlap-inclusion graphs (Q714803) (← links)
- Matrix insertion-deletion systems (Q714867) (← links)
- Periodic and Sturmian languages (Q844208) (← links)
- Extended strings and graphs for simple gene assembly (Q846362) (← links)
- Parallelism in gene assembly (Q876864) (← links)
- Sequential vs. Parallel complexity in simple gene assembly (Q924677) (← links)
- Parallel complexity of signed graphs for gene assembly in ciliates (Q931445) (← links)
- Solutions to computational problems through gene assembly (Q941688) (← links)
- Patterns of simple gene assembly in ciliates (Q948679) (← links)
- Decision problem for shuffled genes (Q958310) (← links)
- Computing the graph-based parallel complexity of gene assembly (Q974100) (← links)
- Accepting splicing systems (Q974105) (← links)
- Graph theoretic approach to parallel gene assembly (Q1003730) (← links)
- The parallel complexity of signed graphs: Decidability results and an improved algorithm (Q1019708) (← links)
- Self-assembly of strings and languages (Q1022589) (← links)
- WEBRSIM: a web-based reaction systems simulator (Q1709911) (← links)
- Commutation with ternary sets of words (Q1771315) (← links)
- Computation in living cells. Gene assembly in ciliates (Q1773223) (← links)
- Conway's problem for three-word sets. (Q1853553) (← links)
- Formal systems for gene assembly in ciliates. (Q1853740) (← links)
- Controllability of reaction systems (Q1982983) (← links)
- Parikh matrices and amiable words (Q2474077) (← links)
- Commutation with codes (Q2484442) (← links)
- Complete characterization for the fit-preserving data refinement of mass-action reaction networks (Q2628773) (← links)
- (Q2708967) (← links)
- (Q2743689) (← links)
- (Q2754174) (← links)
- An Excursion Through Quantitative Model Refinement (Q2789117) (← links)
- The Structure of Elementary Strategies for Gene Assembly in Ciliates (Q2805452) (← links)
- (Q2893299) (← links)
- COMPUTATIONAL POWER OF INTRAMOLECULAR GENE ASSEMBLY (Q3065620) (← links)
- Directed Overlap-inclusion Graphs as Representations of Ciliate Genes (Q3100923) (← links)
- String and graph reduction systems for gene assembly in ciliates (Q3146247) (← links)
- (Q3395981) (← links)
- (Q3395994) (← links)
- (Q3409988) (← links)
- (Q3536083) (← links)
- Summary of the Workshop on Natural Computing and Graph Transformations (Q3540423) (← links)
- GENE ASSEMBLY MODELS AND BOOLEAN CIRCUITS (Q3542874) (← links)
- Computational Heuristics for Simplifying a Biological Model (Q3576072) (← links)
- Computing Through Gene Assembly (Q3603406) (← links)
- Simple Operations for Gene Assembly (Q3618682) (← links)
- (Q4242719) (← links)
- (Q4267179) (← links)
- (Q4418638) (← links)
