Elena Czeizler

Orcid: 0000-0003-4250-3979

Affiliations:
  • University of Turku, Finland


According to our database1, Elena Czeizler authored at least 22 papers between 2003 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2018
One Dimensional DNA Tiles Self Assembly Model Simulation.
Int. J. Unconv. Comput., 2018

2017
Computational modelling of the kinetic Tile Assembly Model using a rule-based approach.
Theor. Comput. Sci., 2017

A Graph-Theoretical Approach for Motif Discovery in Protein Sequences.
IEEE ACM Trans. Comput. Biol. Bioinform., 2017

2012
Quantitative Analysis of the Self-Assembly Strategies of Intermediate Filaments from Tetrameric Vimentin.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Quantitative Refinement of Reaction Models.
Int. J. Unconv. Comput., 2012

A Boolean Approach for Disentangling the Roles of Submodules to the Global Properties of a Biomodel.
Fundam. Informaticae, 2012

2011
An extension of the Lyndon-Schützenberger result to pseudoperiodic words.
Inf. Comput., 2011

Quantitative Model Refinement as a Solution to the Combinatorial Size Explosion of Biomodels.
Proceedings of the 2nd International Workshop on Static Analysis and Systems Biology, 2011

2010
On a special class of primitive words.
Theor. Comput. Sci., 2010

2009
On systems of word equations over three unknowns with at most six occurrences of one of the unknowns.
Theor. Comput. Sci., 2009

On the descriptional complexity of Watson-Crick automata.
Theor. Comput. Sci., 2009

Control Strategies for the Regulation of the Eukaryotic Heat Shock Response.
Proceedings of the Computational Methods in Systems Biology, 7th International Conference, 2009

2008
Multiple constraints on three and four words.
Theor. Comput. Sci., 2008

Watson-Crick automata: determinism and state complexity.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007
On Non-Periodic Solutions of Independent Systems of Word Equations over Three Unknowns.
Int. J. Found. Comput. Sci., 2007

Intricacies of Simple Word Equations: an Example.
Int. J. Found. Comput. Sci., 2007

2006
On the power of parallel communicating Watson-Crick automata systems.
Theor. Comput. Sci., 2006

A Short Survey on Watson-Crick Automata.
Bull. EATCS, 2006

Parallel Communicating Watson-Crick Automata Systems.
Acta Cybern., 2006

2005
The non-parametrizability of the word equation <i>xyz</i>=<i>zvx</i>: A short proof.
Theor. Comput. Sci., 2005

2004
An Elementary Proof for the Non-parametrizability of the Equation xyz=zvx.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003
Watson-Crick ω-Automata.
J. Autom. Lang. Comb., 2003


  Loading...