The following pages link to Ion Petre (Q223821):
Displaying 20 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)
- Quantitative Model Refinement as a Solution to the Combinatorial Size Explosion of Biomodels (Q5404094) (← links)
- (Q5507075) (← links)