We stand with Ukraine

We stand with Ukraine

Michael Domaratzki

Orcid: 0000-0001-9129-6676

Affiliations:

University of Western Ontario, London, ON, Canada

According to our database¹, Michael Domaratzki authored at least 52 papers between 2001 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

2024

Conditional probabilistic diffusion model driven synthetic radiogenomic applications in breast cancer.

[BibT_eX]

[DOI]

,

,

,

Mike Domaratzki

,

,

PLoS Comput. Biol., 2024

2022

Minimizing features while maintaining performance in data classification problems.

[BibT_eX]

[DOI]

Surani Matharaarachchi

,

Mike Domaratzki

,

Saman Muthukumarana

PeerJ Comput. Sci., 2022

Crop genomic selection with deep learning and environmental data: A survey.

[BibT_eX]

[DOI]

,

Mike Domaratzki

Frontiers Artif. Intell., 2022

Sparse bayesian learning for genomic selection in yeast.

[BibT_eX]

[DOI]

,

Mike Domaratzki

Frontiers Bioinform., 2022

2019

Ensemble supervised learning for genomic selection.

[BibT_eX]

[DOI]

,

Michael Domaratzki

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.

[BibT_eX]

[DOI]

Md. Mohaiminul Islam

,

,

,

Michael Domaratzki

,

,

Proceedings of the Advances in Artificial Intelligence, 2017

2014

Metabolic Network Prediction Through Pairwise Rational Kernels.

[BibT_eX]

[DOI]

Abiel Roche-Lima

,

Michael Domaratzki

,

Brian Fristensky

BMC Bioinform., 2014

Pairwise Rational Kernels Obtained by Automaton Operations.

[BibT_eX]

[DOI]

Abiel Roche-Lima

,

Michael Domaratzki

,

Brian Fristensky

Proceedings of the Implementation and Application of Automata, 2014

Prediction of Insertion-Site Preferences of Transposons Using Support Vector Machines and Artificial Neural Networks.

[BibT_eX]

[DOI]

,

Michael Domaratzki

Proceedings of the Artificial Neural Networks in Pattern Recognition, 2014

2013

Composition and orbits of language operations: finiteness and upper bounds.

[BibT_eX]

[DOI]

Emilie Charlier

,

Michael Domaratzki

,

,

Jeffrey O. Shallit

Int. J. Comput. Math., 2013

2012

Abelian Primitive Words.

[BibT_eX]

[DOI]

Michael Domaratzki

,

Narad Rampersad

Int. J. Found. Comput. Sci., 2012

2011

Preface.

[BibT_eX]

[DOI]

Michael Domaratzki

,

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

Finite Orbits of Language Operations.

[BibT_eX]

[DOI]

Emilie Charlier

,

Michael Domaratzki

,

,

Jeffrey O. Shallit

Proceedings of the Language and Automata Theory and Applications, 2011

On Language Decompositions and Primality.

[BibT_eX]

[DOI]

Michael Domaratzki

,

Proceedings of the Rainbow of Computer Science, 2011

2010

Orthogonal Concatenation: Language Equations and State Complexity.

[BibT_eX]

[DOI]

,

Michael Domaratzki

,

J. Univers. Comput. Sci., 2010

2009

State complexity of power.

[BibT_eX]

[DOI]

Michael Domaratzki

,

Alexander Okhotin

Theor. Comput. Sci., 2009

Hairpin Structures Defined by DNA Trajectories.

[BibT_eX]

[DOI]

Michael Domaratzki

Theory Comput. Syst., 2009

Minimality in template-guided recombination.

[BibT_eX]

[DOI]

Michael Domaratzki

Inf. Comput., 2009

Template-Guided Recombination: From Theory to Laboratory.

[BibT_eX]

[DOI]

,

Michael Domaratzki

Proceedings of the Algorithmic Bioprocesses, 2009

2008

Equivalence in template-guided recombination.

[BibT_eX]

[DOI]

Michael Domaratzki

Nat. Comput., 2008

Lower bounds for the transition complexity of NFAs.

[BibT_eX]

[DOI]

Michael Domaratzki

,

J. Comput. Syst. Sci., 2008

Characterizing DNA Bond Shapes Using Trajectories.

[BibT_eX]

[DOI]

Michael Domaratzki

Fundam. Informaticae, 2008

Formal Language Tools for Template-Guided DNA Recombination.

[BibT_eX]

[DOI]

Michael Domaratzki

Proceedings of the Language and Automata Theory and Applications, 2008

State Complexity of Orthogonal Catenation.

[BibT_eX]

,

Michael Domaratzki

,

Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007

Transition complexity of language operations.

[BibT_eX]

[DOI]

Michael Domaratzki

,

Theor. Comput. Sci., 2007

On codes defined by bio-operations.

[BibT_eX]

[DOI]

,

Michael Domaratzki

Theor. Comput. Sci., 2007

Bond-free DNA language classes.

[BibT_eX]

[DOI]

Michael Domaratzki

Nat. Comput., 2007

Enumeration of Context-Free Languages and Related Structures.

[BibT_eX]

[DOI]

Michael Domaratzki

,

Alexander Okhotin

,

Jeffrey O. Shallit

J. Autom. Lang. Comb., 2007

Intra-Molecular Template-Guided Recombination.

[BibT_eX]

[DOI]

,

Michael Domaratzki

,

Int. J. Found. Comput. Sci., 2007

2006

Algebraic properties of substitution on trajectories.

[BibT_eX]

[DOI]

Michael Domaratzki

,

,

Alfonso Rodríguez-Patón

Theor. Comput. Sci., 2006

Codes defined by multiple sets of trajectories.

[BibT_eX]

[DOI]

Michael Domaratzki

,

Theor. Comput. Sci., 2006

Interpreted Trajectories.

[BibT_eX]

[DOI]

Michael Domaratzki

,

Grzegorz Rozenberg

,

Fundam. Informaticae, 2006

Enumeration of Formal Languages.

[BibT_eX]

Michael Domaratzki

Bull. EATCS, 2006

2005

Decidability of trajectory-based equations.

[BibT_eX]

[DOI]

Michael Domaratzki

,

Theor. Comput. Sci., 2005

Restricted sets of trajectories and decidability of shuffle decompositions.

[BibT_eX]

[DOI]

Michael Domaratzki

,

Int. J. Found. Comput. Sci., 2005

Non-uniqueness and radius of cyclic unary NFAs.

[BibT_eX]

[DOI]

Michael Domaratzki

,

,

Jeffrey O. Shallit

,

Int. J. Found. Comput. Sci., 2005

More Words on Trajectories.

[BibT_eX]

Michael Domaratzki

Bull. EATCS, 2005

2004

Representing recursively enumerable languages by iterated deletion.

[BibT_eX]

[DOI]

Michael Domaratzki

,

Alexander Okhotin

Theor. Comput. Sci., 2004

Deletion along trajectories.

[BibT_eX]

[DOI]

Michael Domaratzki

Theor. Comput. Sci., 2004

State Complexity of Shuffle on Trajectories.

[BibT_eX]

[DOI]

Michael Domaratzki

,

J. Autom. Lang. Comb., 2004

Improved Bounds On The Number Of Automata Accepting Finite Languages.

[BibT_eX]

[DOI]

Michael Domaratzki

Int. J. Found. Comput. Sci., 2004

Trajectory-Based Embedding Relations.

[BibT_eX]

[DOI]

Michael Domaratzki

Fundam. Informaticae, 2004

Trajectory-based codes.

[BibT_eX]

[DOI]

Michael Domaratzki

Acta Informatica, 2004

Semantic Shuffle on and Deletion Along Trajectories.

[BibT_eX]

[DOI]

Michael Domaratzki

Proceedings of the Developments in Language Theory, 2004

2003

On Iterated Scattered Deletion.

[BibT_eX]

Michael Domaratzki

Bull. EATCS, 2003

On Enumeration of Müller Automata.

[BibT_eX]

[DOI]

Michael Domaratzki

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.

[BibT_eX]

[DOI]

Michael Domaratzki

,

,

Jeffrey O. Shallit

J. Autom. Lang. Comb., 2002

State Complexity of Proportional Removals.

[BibT_eX]

[DOI]

Michael Domaratzki

J. Autom. Lang. Comb., 2002

Simulating finite automata with context-free grammars.

[BibT_eX]

[DOI]

Michael Domaratzki

,

Giovanni Pighizzini

,

Jeffrey O. Shallit

Inf. Process. Lett., 2002

One-Visit Caterpillar Tree Automata.

[BibT_eX]

[DOI]

Alexander Okhotin

,

,

Michael Domaratzki

Fundam. Informaticae, 2002

2001

Minimal Covers of Formal Languages.

[BibT_eX]

[DOI]

Michael Domaratzki

,

Jeffrey O. Shallit

,

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

State Complexity and Proportional Removals.

[BibT_eX]

Michael Domaratzki

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

Loading...