Michael Domaratzki

Publication Activity (10 Years)

Years Active: 2001-2019
Publications (10 Years): 2

Top Topics

Algebraic Properties

Top Venues

Canadian Conference on AI

Int. J. Found. Comput. Sci.

Publications

Sheikh Jubair, Michael Domaratzki
Ensemble supervised learning for genomic selection. BIBM (2019)
Md. Mohaiminul Islam, Rasif Ajwad, Chen Chi, Michael Domaratzki, Yang Wang, Pingzhao Hu
Somatic Copy Number Alteration-Based Prediction of Molecular Subtypes of Breast Cancer Using Deep Learning Model. Canadian Conference on AI (2017)
Abiel Roche-Lima, Michael Domaratzki, Brian Fristensky
Pairwise Rational Kernels Obtained by Automaton Operations. CIAA (2014)
Maryam Ayat, Michael Domaratzki
Prediction of Insertion-Site Preferences of Transposons Using Support Vector Machines and Artificial Neural Networks. ANNPR (2014)
Abiel Roche-Lima, Michael Domaratzki, Brian Fristensky
Metabolic Network Prediction Through Pairwise Rational Kernels. BMC Bioinform. 15 (2014)
Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit
Composition and orbits of language operations: finiteness and upper bounds. Int. J. Comput. Math. 90 (6) (2013)
Michael Domaratzki, Narad Rampersad
Abelian Primitive Words. Int. J. Found. Comput. Sci. 23 (5) (2012)
Michael Domaratzki, Narad Rampersad
Abelian Primitive Words. Developments in Language Theory (2011)
Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit
Finite Orbits of Language Operations CoRR (2011)
Michael Domaratzki, Kai Salomaa
On Language Decompositions and Primality. Rainbow of Computer Science (2011)
Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit
Finite Orbits of Language Operations. LATA (2011)
Michael Domaratzki, Kai Salomaa
Preface. Int. J. Found. Comput. Sci. 22 (8) (2011)
Michael Domaratzki, Narad Rampersad
Abelian Primitive Words CoRR (2010)
Mark Daley, Michael Domaratzki, Kai Salomaa
Orthogonal Concatenation: Language Equations and State Complexity. J. Univers. Comput. Sci. 16 (5) (2010)
Mark Daley, Michael Domaratzki, Kai Salomaa
State complexity of orthogonal catenation CoRR (2009)
Michael Domaratzki
Minimality in template-guided recombination. Inf. Comput. 207 (11) (2009)
Michael Domaratzki
Hairpin Structures Defined by DNA Trajectories. Theory Comput. Syst. 44 (3) (2009)
Michael Domaratzki, Alexander Okhotin
State complexity of power. Theor. Comput. Sci. 410 (24-25) (2009)
Mark Daley, Michael Domaratzki
Template-Guided Recombination: From Theory to Laboratory. Algorithmic Bioprocesses (2009)
Michael Domaratzki
Formal Language Tools for Template-Guided DNA Recombination. LATA (2008)
Michael Domaratzki, Kai Salomaa
Lower bounds for the transition complexity of NFAs. J. Comput. Syst. Sci. 74 (7) (2008)
Michael Domaratzki, Kai Salomaa
Preface. Int. J. Found. Comput. Sci. 19 (5) (2008)
Michael Domaratzki
Characterizing DNA Bond Shapes Using Trajectories. Fundam. Informaticae 87 (3-4) (2008)
Michael Domaratzki
Equivalence in template-guided recombination. Nat. Comput. 7 (3) (2008)
Mark Daley, Michael Domaratzki, Kai Salomaa
State Complexity of Orthogonal Catenation. DCFS (2008)
Michael Domaratzki
Bond-free DNA language classes. Nat. Comput. 6 (4) (2007)
Mark Daley, Michael Domaratzki, Alexis Morris
Intra-Molecular Template-Guided Recombination. Int. J. Found. Comput. Sci. 18 (6) (2007)
Michael Domaratzki, Kai Salomaa
Transition complexity of language operations. Theor. Comput. Sci. 387 (2) (2007)
Mark Daley, Michael Domaratzki
On codes defined by bio-operations. Theor. Comput. Sci. 378 (1) (2007)
Michael Domaratzki, Alexander Okhotin, Jeffrey O. Shallit
Enumeration of Context-Free Languages and Related Structures. J. Autom. Lang. Comb. 12 (1-2) (2007)
Michael Domaratzki
Equivalence in Template-Guided Recombination. DNA (2007)
Michael Domaratzki, Grzegorz Rozenberg, Kai Salomaa
Interpreted Trajectories. Fundam. Informaticae 73 (1-2) (2006)
Michael Domaratzki
Hairpin Structures Defined by DNA Trajectories. DNA (2006)
Michael Domaratzki, Kai Salomaa
Transition Complexity of Language Operations. DCFS (2006)
Michael Domaratzki, Petr Sosík, Alfonso Rodríguez-Patón
Algebraic properties of substitution on trajectories. Theor. Comput. Sci. 369 (1-3) (2006)
Michael Domaratzki
Characterizing DNA Bond Shapes Using Trajectories. Developments in Language Theory (2006)
Michael Domaratzki, Kai Salomaa
Codes defined by multiple sets of trajectories. Theor. Comput. Sci. 366 (3) (2006)
Michael Domaratzki
Enumeration of Formal Languages. Bull. EATCS 89 (2006)
Michael Domaratzki, Kai Salomaa
Lower Bounds for the Transition Complexity of NFAs. MFCS (2006)
Michael Domaratzki
More Words on Trajectories. Bull. EATCS 86 (2005)
Michael Domaratzki, Keith Ellul, Jeffrey O. Shallit, Ming-wei Wang
Non-uniqueness and radius of cyclic unary NFAs. Int. J. Found. Comput. Sci. 16 (5) (2005)
Michael Domaratzki, Kai Salomaa
Restricted sets of trajectories and decidability of shuffle decompositions. Int. J. Found. Comput. Sci. 16 (5) (2005)
Michael Domaratzki, Kai Salomaa
Decidability of trajectory-based equations. Theor. Comput. Sci. 345 (2-3) (2005)
Michael Domaratzki, Alexander Okhotin, Jeffrey O. Shallit
Enumeration of Context-Free Languages and Related Structures. DCFS (2005)
Michael Domaratzki, Kai Salomaa
Restricted sets of trajectories and decidability of shuffle decompositions. DCFS (2004)
Michael Domaratzki, Kai Salomaa
Decidability of Trajectory-Based Equations. MFCS (2004)
Michael Domaratzki, Keith Ellul, Jeffrey O. Shallit, Ming-wei Wang
Non-Uniqueness and Radius of Cyclic Unary NFAs. DCFS (2004)
Michael Domaratzki, Kai Salomaa
State Complexity of Shuffle on Trajectories. J. Autom. Lang. Comb. 9 (2/3) (2004)
Michael Domaratzki
Improved Bounds On The Number Of Automata Accepting Finite Languages. Int. J. Found. Comput. Sci. 15 (1) (2004)
Michael Domaratzki
Trajectory-Based Embedding Relations. Fundam. Informaticae 59 (4) (2004)
Michael Domaratzki
Semantic Shuffle on and Deletion Along Trajectories. Developments in Language Theory (2004)
Mark Daley, Michael Domaratzki
On Codes Defined by Bio-Operations. Developments in Language Theory (2004)
Michael Domaratzki
Trajectory-based codes. Acta Informatica 40 (6-7) (2004)
Michael Domaratzki, Alexander Okhotin
Representing recursively enumerable languages by iterated deletion. Theor. Comput. Sci. 314 (3) (2004)
Michael Domaratzki
Deletion along trajectories. Theor. Comput. Sci. 320 (2-3) (2004)
Michael Domaratzki
On Enumeration of Müller Automata. Developments in Language Theory (2003)
Michael Domaratzki
On Iterated Scattered Deletion. Bull. EATCS 80 (2003)
Michael Domaratzki
Improved Bounds on the Number of Automata Accepting Finite Languages. Developments in Language Theory (2002)
Michael Domaratzki, Kai Salomaa
State Complexity of Shuffle on Trajectories. DCFS (2002)
Alexander Okhotin, Kai Salomaa, Michael Domaratzki
One-Visit Caterpillar Tree Automata. Fundam. Informaticae 52 (4) (2002)
Michael Domaratzki, Derek Kisman, Jeffrey O. Shallit
On the Number of Distinct Languages Accepted by Finite Automata with n States. J. Autom. Lang. Comb. 7 (4) (2002)
Michael Domaratzki, Giovanni Pighizzini, Jeffrey O. Shallit
Simulating finite automata with context-free grammars. Inf. Process. Lett. 84 (6) (2002)
Michael Domaratzki
State Complexity of Proportional Removals. J. Autom. Lang. Comb. 7 (4) (2002)
Michael Domaratzki
State Complexity and Proportional Removals. DCFS (2001)
Michael Domaratzki, Derek Kisman, Jeffrey O. Shallit
On the Number of Distinct Languages Accepted by Finite Automata with n States. DCFS (2001)
Michael Domaratzki, Jeffrey O. Shallit, Sheng Yu
Minimal Covers of Formal Languages. Developments in Language Theory (2001)