Mark Daley - Citegraph

Author Info

Name	Affiliation	Papers
MARK DALEY	Department of Computer Science, The University of Western Ontario, London, Ontario, Canada, N6A 5B7	42
Collaborators	Citations	PageRank
41	166	22.18
Referers	Referees	References
159	317	245

Search Limit

100317

Publications (42 rows)

Collaborators (41 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
From Helmut Jürgensen's Former Students: The Game of Informatics Research.	0	0.34	2019
Novelty Search for Deep Reinforcement Learning Policy Network Weights by Action Sequence Edit Metric Distance.	1	0.36	2019
Searching for nonlinear relationships in fMRI data with symbolic regression.	0	0.34	2017
Halting the hallmarks: a cellular automaton model of early cancer growth inhibition	0	0.34	2016
Finding Nonlinear Relationships in fMRI Time Series with Symbolic Regression.	1	0.38	2016
Gene co-citation networks associated with worker sterility in honey bees.	4	0.37	2014
HD-CNV: hotspot detector for copy number variants.	1	0.39	2013
Relativized codes	0	0.34	2012
Algorithmic decomposition of shuffle on words	3	0.45	2012
One-reversal counter machines and multihead automata: revisited	4	0.44	2012
Orthogonal Shuffle On Trajectories	0	0.34	2011
Theoretical and computational properties of transpositions	1	0.37	2011
A relation by palindromic subwords	0	0.34	2010
Orthogonal Concatenation: Language Equations and State Complexity	4	0.39	2010
Modelling programmed frameshifting with frameshift machines	0	0.34	2010
Constructures: Supporting Human Ingenuity In Software	0	0.34	2009
Template-Guided Recombination: From Theory to Laboratory	0	0.34	2009
On The Shuffle Automaton Size For Words	2	0.37	2009
On the uniqueness of shuffle on words and finite languages	5	0.57	2009
State complexity of orthogonal catenation	11	0.54	2008
On the Processing Power of Protozoa	1	0.40	2008
A useful bounded resource functional language	0	0.34	2008
Computation By Annotation: Modelling Epigenetic Regulation	0	0.34	2008
The bag automaton: a model of nondeterministic storage	1	0.39	2008
Dynamic ADTs: a "don't ask, don't tell" policy for data abstraction.	1	0.35	2007
Intra-Molecular Template-Guided Recombination	2	0.45	2007
On codes defined by bio-operations	1	0.38	2007
Voronoi diagrams, vectors and the visually impaired	1	0.59	2006
Regulated RNA rewriting: Modelling RNA editing with guided insertion	15	0.82	2006
Useful Templates and Iterated Template-Guided DNA Recombination in Ciliates	8	0.90	2006
Iterated TGR languages: membership problem and effective closure properties	5	0.59	2006
On computational properties of template-guided DNA recombination	10	0.95	2005
Formal Modelling Of Viral Gene Compression	1	0.40	2005
Families of languages defined by ciliate bio-operations.	11	0.84	2004
Viral gene compression: complexity and verification	4	0.48	2004
Bag automata and stochastic retrieval of biomolecules in solution	0	0.34	2003
Template-guided DNA recombination	9	0.98	2003
Closure and decidability properties of some language classes with respect to ciliate bio-operations	19	1.02	2003
The ld and dlad bio-operations on formal languages	7	0.73	2003
Some properties of ciliate bio-operations	13	1.11	2002
Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation	20	1.80	1999
How to Compute with DNA	0	0.34	1999