Michael Domaratzki

Orcid: 0000-0001-9129-6676

Affiliations:
  • University of Western Ontario, London, ON, Canada


According to our database1, Michael Domaratzki authored at least 51 papers between 2001 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Minimizing features while maintaining performance in data classification problems.
PeerJ Comput. Sci., 2022

Crop genomic selection with deep learning and environmental data: A survey.
Frontiers Artif. Intell., 2022

Sparse bayesian learning for genomic selection in yeast.
Frontiers Bioinform., 2022

2019
Ensemble supervised learning for genomic selection.
Proceedings of the 2019 IEEE International Conference on Bioinformatics and Biomedicine, 2019

2017
Somatic Copy Number Alteration-Based Prediction of Molecular Subtypes of Breast Cancer Using Deep Learning Model.
Proceedings of the Advances in Artificial Intelligence, 2017

2014
Metabolic Network Prediction Through Pairwise Rational Kernels.
BMC Bioinform., 2014

Pairwise Rational Kernels Obtained by Automaton Operations.
Proceedings of the Implementation and Application of Automata, 2014

Prediction of Insertion-Site Preferences of Transposons Using Support Vector Machines and Artificial Neural Networks.
Proceedings of the Artificial Neural Networks in Pattern Recognition, 2014

2013
Composition and orbits of language operations: finiteness and upper bounds.
Int. J. Comput. Math., 2013

2012
Abelian Primitive Words.
Int. J. Found. Comput. Sci., 2012

2011
Preface.
Int. J. Found. Comput. Sci., 2011

Finite Orbits of Language Operations.
Proceedings of the Language and Automata Theory and Applications, 2011

On Language Decompositions and Primality.
Proceedings of the Rainbow of Computer Science, 2011

2010
Orthogonal Concatenation: Language Equations and State Complexity.
J. Univers. Comput. Sci., 2010

2009
State complexity of power.
Theor. Comput. Sci., 2009

Hairpin Structures Defined by DNA Trajectories.
Theory Comput. Syst., 2009

Minimality in template-guided recombination.
Inf. Comput., 2009

Template-Guided Recombination: From Theory to Laboratory.
Proceedings of the Algorithmic Bioprocesses, 2009

2008
Equivalence in template-guided recombination.
Nat. Comput., 2008

Lower bounds for the transition complexity of NFAs.
J. Comput. Syst. Sci., 2008

Characterizing DNA Bond Shapes Using Trajectories.
Fundam. Informaticae, 2008

Formal Language Tools for Template-Guided DNA Recombination.
Proceedings of the Language and Automata Theory and Applications, 2008

State Complexity of Orthogonal Catenation.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007
Transition complexity of language operations.
Theor. Comput. Sci., 2007

On codes defined by bio-operations.
Theor. Comput. Sci., 2007

Bond-free DNA language classes.
Nat. Comput., 2007

Enumeration of Context-Free Languages and Related Structures.
J. Autom. Lang. Comb., 2007

Intra-Molecular Template-Guided Recombination.
Int. J. Found. Comput. Sci., 2007

2006
Algebraic properties of substitution on trajectories.
Theor. Comput. Sci., 2006

Codes defined by multiple sets of trajectories.
Theor. Comput. Sci., 2006

Interpreted Trajectories.
Fundam. Informaticae, 2006

Enumeration of Formal Languages.
Bull. EATCS, 2006

2005
Decidability of trajectory-based equations.
Theor. Comput. Sci., 2005

Restricted sets of trajectories and decidability of shuffle decompositions.
Int. J. Found. Comput. Sci., 2005

Non-uniqueness and radius of cyclic unary NFAs.
Int. J. Found. Comput. Sci., 2005

More Words on Trajectories.
Bull. EATCS, 2005

2004
Representing recursively enumerable languages by iterated deletion.
Theor. Comput. Sci., 2004

Deletion along trajectories.
Theor. Comput. Sci., 2004

State Complexity of Shuffle on Trajectories.
J. Autom. Lang. Comb., 2004

Improved Bounds On The Number Of Automata Accepting Finite Languages.
Int. J. Found. Comput. Sci., 2004

Trajectory-Based Embedding Relations.
Fundam. Informaticae, 2004

Trajectory-based codes.
Acta Informatica, 2004

Semantic Shuffle on and Deletion Along Trajectories.
Proceedings of the Developments in Language Theory, 2004

2003
On Iterated Scattered Deletion.
Bull. EATCS, 2003

On Enumeration of Müller Automata.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

2002
On the Number of Distinct Languages Accepted by Finite Automata with n States.
J. Autom. Lang. Comb., 2002

State Complexity of Proportional Removals.
J. Autom. Lang. Comb., 2002

Simulating finite automata with context-free grammars.
Inf. Process. Lett., 2002

One-Visit Caterpillar Tree Automata.
Fundam. Informaticae, 2002

2001
Minimal Covers of Formal Languages.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

State Complexity and Proportional Removals.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001


  Loading...