Michael Domaratzki

68 papers B 4C 12Journal 39Unranked 13

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