default search action
Michael Domaratzki
Person information
- affiliation: University of Western Ontario, London, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j39]Maryam Ayat, Mike Domaratzki
:
Sparse bayesian learning for genomic selection in yeast. Frontiers Bioinform. 2 (2022) - [j38]Sheikh Jubair
Crop genomic selection with deep learning and environmental data: A survey. Frontiers Artif. Intell. 5 (2022) - [j37]Surani Matharaarachchi
Minimizing features while maintaining performance in data classification problems. PeerJ Comput. Sci. 8: e1081 (2022)
2010 – 2019
- 2019
- [c27]Sheikh Jubair
Ensemble supervised learning for genomic selection. BIBM 2019: 1993-2000 - 2017
- [c26]Md. Mohaiminul Islam, Rasif Ajwad, Chen Chi, Michael Domaratzki
Somatic Copy Number Alteration-Based Prediction of Molecular Subtypes of Breast Cancer Using Deep Learning Model. Canadian AI 2017: 57-63 - 2014
- [j36]Abiel Roche-Lima, Michael Domaratzki
Metabolic Network Prediction Through Pairwise Rational Kernels. BMC Bioinform. 15: 318 (2014) - [c25]Maryam Ayat, Michael Domaratzki:
Prediction of Insertion-Site Preferences of Transposons Using Support Vector Machines and Artificial Neural Networks. ANNPR 2014: 183-192 - [c24]Abiel Roche-Lima, Michael Domaratzki
Pairwise Rational Kernels Obtained by Automaton Operations. CIAA 2014: 332-345 - 2013
- [j35]Emilie Charlier, Michael Domaratzki
Composition and orbits of language operations: finiteness and upper bounds. Int. J. Comput. Math. 90(6): 1171-1196 (2013) - 2012
- [j34]Michael Domaratzki
Abelian Primitive Words. Int. J. Found. Comput. Sci. 23(5): 1021-1034 (2012) - 2011
- [j33]Michael Domaratzki, Kai Salomaa:
Preface. Int. J. Found. Comput. Sci. 22(8) (2011) - [c23]Michael Domaratzki, Kai Salomaa:
On Language Decompositions and Primality. Rainbow of Computer Science 2011: 63-75 - [c22]Michael Domaratzki
Abelian Primitive Words. Developments in Language Theory 2011: 204-215 - [c21]Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit:
Finite Orbits of Language Operations. LATA 2011: 204-215 - [e2]Michael Domaratzki, Kai Salomaa:
Implementation and Application of Automata - 15th International Conference, CIAA 2010, Winnipeg, MB, Canada, August 12-15, 2010. Revised Selected Papers. Lecture Notes in Computer Science 6482, Springer 2011, ISBN 978-3-642-18097-2 [contents] - [i3]Emilie Charlier, Michael Domaratzki, Tero Harju, Jeffrey O. Shallit:
Finite Orbits of Language Operations. CoRR abs/1101.1667 (2011) - 2010
- [j32]Mark Daley, Michael Domaratzki, Kai Salomaa:
Orthogonal Concatenation: Language Equations and State Complexity. J. Univers. Comput. Sci. 16(5): 653-675 (2010) - [i2]Michael Domaratzki, Narad Rampersad:
Abelian Primitive Words. CoRR abs/1006.4104 (2010)
2000 – 2009
- 2009
- [j31]Michael Domaratzki
Minimality in template-guided recombination. Inf. Comput. 207(11): 1209-1220 (2009) - [j30]Michael Domaratzki
Hairpin Structures Defined by DNA Trajectories. Theory Comput. Syst. 44(3): 432-454 (2009) - [j29]Michael Domaratzki
State complexity of power. Theor. Comput. Sci. 410(24-25): 2377-2392 (2009) - [c20]Mark Daley, Michael Domaratzki
Template-Guided Recombination: From Theory to Laboratory. Algorithmic Bioprocesses 2009: 117-137 - [i1]Mark Daley, Michael Domaratzki, Kai Salomaa:
State complexity of orthogonal catenation. CoRR abs/0904.3366 (2009) - 2008
- [j28]Michael Domaratzki:
Characterizing DNA Bond Shapes Using Trajectories. Fundam. Informaticae 87(3-4): 269-285 (2008) - [j27]Michael Domaratzki
Preface. Int. J. Found. Comput. Sci. 19(5): 1085-1086 (2008) - [j26]Michael Domaratzki
Lower bounds for the transition complexity of NFAs. J. Comput. Syst. Sci. 74(7): 1116-1130 (2008) - [j25]Michael Domaratzki
Equivalence in template-guided recombination. Nat. Comput. 7(3): 439-449 (2008) - [c19]Mark Daley, Michael Domaratzki, Kai Salomaa:
State Complexity of Orthogonal Catenation. DCFS 2008: 134-144 - [c18]Michael Domaratzki
Formal Language Tools for Template-Guided DNA Recombination. LATA 2008: 3-5 - 2007
- [j24]Mark Daley, Michael Domaratzki
Intra-Molecular Template-Guided Recombination. Int. J. Found. Comput. Sci. 18(6): 1177-1186 (2007) - [j23]Michael Domaratzki, Alexander Okhotin, Jeffrey O. Shallit:
Enumeration of Context-Free Languages and Related Structures. J. Autom. Lang. Comb. 12(1-2): 79-95 (2007) - [j22]Michael Domaratzki
Bond-free DNA language classes. Nat. Comput. 6(4): 371-402 (2007) - [j21]Mark Daley, Michael Domaratzki
On codes defined by bio-operations. Theor. Comput. Sci. 378(1): 3-16 (2007) - [j20]Michael Domaratzki
Transition complexity of language operations. Theor. Comput. Sci. 387(2): 147-154 (2007) - [c17]Michael Domaratzki
Equivalence in Template-Guided Recombination. DNA 2007: 263-272 - 2006
- [j19]Michael Domaratzki:
Enumeration of Formal Languages. Bull. EATCS 89: 117-133 (2006) - [j18]Michael Domaratzki, Grzegorz Rozenberg, Kai Salomaa:
Interpreted Trajectories. Fundam. Informaticae 73(1-2): 81-97 (2006) - [j17]Michael Domaratzki
Codes defined by multiple sets of trajectories. Theor. Comput. Sci. 366(3): 182-193 (2006) - [j16]Michael Domaratzki
Algebraic properties of substitution on trajectories. Theor. Comput. Sci. 369(1-3): 183-196 (2006) - [c16]Michael Domaratzki, Kai Salomaa:
Transition Complexity of Language Operations. DCFS 2006: 141-152 - [c15]Michael Domaratzki
Characterizing DNA Bond Shapes Using Trajectories. Developments in Language Theory 2006: 180-191 - [c14]Michael Domaratzki
Hairpin Structures Defined by DNA Trajectories. DNA 2006: 182-194 - [c13]Michael Domaratzki, Kai Salomaa:
Lower Bounds for the Transition Complexity of NFAs. MFCS 2006: 315-326 - 2005
- [j15]Michael Domaratzki:
More Words on Trajectories. Bull. EATCS 86: 107-145 (2005) - [j14]Michael Domaratzki
Non-uniqueness and radius of cyclic unary NFAs. Int. J. Found. Comput. Sci. 16(5): 883-896 (2005) - [j13]Michael Domaratzki
Restricted sets of trajectories and decidability of shuffle decompositions. Int. J. Found. Comput. Sci. 16(5): 897-912 (2005) - [j12]Michael Domaratzki
Decidability of trajectory-based equations. Theor. Comput. Sci. 345(2-3): 304-330 (2005) - [c12]Michael Domaratzki, Alexander Okhotin, Jeffrey O. Shallit:
Enumeration of Context-Free Languages and Related Structures. DCFS 2005: 85-96 - 2004
- [j11]Michael Domaratzki
Trajectory-based codes. Acta Informatica 40(6-7): 491-527 (2004) - [j10]Michael Domaratzki:
Trajectory-Based Embedding Relations. Fundam. Informaticae 59(4): 349-363 (2004) - [j9]Michael Domaratzki
Improved Bounds On The Number Of Automata Accepting Finite Languages. Int. J. Found. Comput. Sci. 15(1): 143-161 (2004) - [j8]Michael Domaratzki, Kai Salomaa:
State Complexity of Shuffle on Trajectories. J. Autom. Lang. Comb. 9(2/3): 217-232 (2004) - [j7]Michael Domaratzki
Representing recursively enumerable languages by iterated deletion. Theor. Comput. Sci. 314(3): 451-457 (2004) - [j6]Michael Domaratzki
Deletion along trajectories. Theor. Comput. Sci. 320(2-3): 293-313 (2004) - [c11]Michael Domaratzki, Kai Salomaa:
Restricted sets of trajectories and decidability of shuffle decompositions. DCFS 2004: 37-51 - [c10]Michael Domaratzki, Keith Ellul, Jeffrey O. Shallit, Ming-wei Wang:
Non-Uniqueness and Radius of Cyclic Unary NFAs. DCFS 2004: 178-190 - [c9]Mark Daley, Michael Domaratzki:
On Codes Defined by Bio-Operations. Developments in Language Theory 2004: 127-138 - [c8]Michael Domaratzki:
Semantic Shuffle on and Deletion Along Trajectories. Developments in Language Theory 2004: 163-174 - [c7]Michael Domaratzki, Kai Salomaa:
Decidability of Trajectory-Based Equations. MFCS 2004: 723-734 - [e1]Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu:
Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3317, Springer 2004, ISBN 3-540-24318-6 [contents] - 2003
- [j5]Michael Domaratzki:
On Iterated Scattered Deletion. Bull. EATCS 80: 159-161 (2003) - [c6]Michael Domaratzki:
On Enumeration of Müller Automata. Developments in Language Theory 2003: 254-265 - 2002
- [j4]Alexander Okhotin, Kai Salomaa, Michael Domaratzki:
One-Visit Caterpillar Tree Automata. Fundam. Informaticae 52(4): 361-375 (2002) - [j3]Michael Domaratzki
Simulating finite automata with context-free grammars. Inf. Process. Lett. 84(6): 339-344 (2002) - [j2]Michael Domaratzki:
State Complexity of Proportional Removals. J. Autom. Lang. Comb. 7(4): 455-468 (2002) - [j1]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): 469-486 (2002) - [c5]Michael Domaratzki, Kai Salomaa:
State Complexity of Shuffle on Trajectories. DCFS 2002: 95-109 - [c4]Michael Domaratzki:
Improved Bounds on the Number of Automata Accepting Finite Languages. Developments in Language Theory 2002: 209-219 - 2001
- [c3]Michael Domaratzki:
State Complexity and Proportional Removals. DCFS 2001: 55-66 - [c2]Michael Domaratzki, Derek Kisman, Jeffrey O. Shallit:
On the Number of Distinct Languages Accepted by Finite Automata with n States. DCFS 2001: 67-78 - [c1]Michael Domaratzki, Jeffrey O. Shallit, Sheng Yu:
Minimal Covers of Formal Languages. Developments in Language Theory 2001: 319-329
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: