Ian McQuillan

Orcid: 0000-0002-7998-4430

According to our database1, Ian McQuillan authored at least 78 papers between 2003 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
On decision problems concerning contextual insertions and deletions.
Theor. Comput. Sci., 2025

2024
Optimal L-Systems for Stochastic L-system Inference Problems.
CoRR, 2024

Improving Deep Learning Predictions with Simulated Images, and Vice Versa.
CoRR, 2024

Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors.
Proceedings of the Developments in Language Theory - 28th International Conference, 2024

2023
Visit-Bounded Stack Automata.
Theory Comput. Syst., October, 2023

On the complexity of decision problems for some classes of machines and applications.
Inf. Comput., October, 2023

New characterizations of exponential, elementary, and non-elementary time-bounded Turing machines.
Inf. Comput., June, 2023

Stochastic L-system inference from multiple string sequence inputs.
Soft Comput., May, 2023

Unboundedness Problems for Machines with Reversal-Bounded Counters.
Proceedings of the Foundations of Software Science and Computation Structures, 2023

On the Containment Problem for Deterministic Multicounter Machine Models.
Proceedings of the Automated Technology for Verification and Analysis, 2023

2022
On the Complexity of Decision Problems for Counter Machines with Applications to Coding Theory.
Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity.
Theor. Comput. Sci., 2021

Techniques for inferring context-free Lindenmayer systems with genetic algorithm.
Swarm Evol. Comput., 2021

Preface.
Nat. Comput., 2021

Generalizations of Checking Stack Automata: Characterizations and Hierarchies.
Int. J. Found. Comput. Sci., 2021

Space Complexity of Stack Automata Models.
Int. J. Found. Comput. Sci., 2021

On finite-index indexed grammars and their restrictions.
Inf. Comput., 2021

Juxtapose: a gene-embedding approach for comparing co-expression networks.
BMC Bioinform., 2021

2020
Semilinearity of Families of Languages.
Int. J. Found. Comput. Sci., 2020

Inferring Temporal Parametric L-systems Using Cartesian Genetic Programming.
Proceedings of the 32nd IEEE International Conference on Tools with Artificial Intelligence, 2020

A Novel Technique Combining Image Processing, Plant Development Properties, and the Hungarian Algorithm, to Improve Leaf Detection in Maize.
Proceedings of the 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020

The impact of sample size and tissue type on the reproducibility of gene co-expression networks.
Proceedings of the BCB '20: 11th ACM International Conference on Bioinformatics, 2020

2019
On counting functions and slenderness of languages.
Theor. Comput. Sci., 2019

On families of full trios containing counter machine languages.
Theor. Comput. Sci., 2019

State grammars with stores.
Theor. Comput. Sci., 2019

Insertion operations on deterministic reversal-bounded counter machines.
J. Comput. Syst. Sci., 2019

On store languages and applications.
Inf. Comput., 2019

Gene Set Databases: A Fountain of Knowledge or a Siren Call?
Proceedings of the 10th ACM International Conference on Bioinformatics, 2019

2018
On store languages of language acceptors.
Theor. Comput. Sci., 2018

Variations of checking stack automata: Obtaining unexpected decidability properties.
Theor. Comput. Sci., 2018

On the Density of Languages Accepted by Turing Machines and Other Machine Models.
J. Autom. Lang. Comb., 2018

From Helmut Jürgensen's Former Students: The Game of Informatics Research.
J. Autom. Lang. Comb., 2018

On the Density of Context-Free and Counter Languages.
Int. J. Found. Comput. Sci., 2018

On the complexity and decidability of some problems involving shuffle.
Inf. Comput., 2018

Algorithms for Inferring Context-Sensitive L-Systems.
Proceedings of the Unconventional Computation and Natural Computation, 2018

A Fast and Reliable Hybrid Approach for Inferring L-systems .
Proceedings of the 2018 Conference on Artificial Life, 2018

Inferring Stochastic L-Systems Using a Hybrid Greedy Algorithm.
Proceedings of the IEEE 30th International Conference on Tools with Artificial Intelligence, 2018

DNA Methylation Data to Predict Suicidal and Non-Suicidal Deaths: A Machine Learning Approach.
Proceedings of the IEEE International Conference on Healthcare Informatics, 2018

On Counting Functions of Languages.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Input-Position-Restricted Models of Language Acceptors.
Proceedings of the Reversibility and Universality, 2018

New Techniques for Inferring L-systems Using Genetic Algorithm.
Proceedings of the Bioinspired Optimization Methods and Their Applications, 2018

Sample Size and Reproducibility of Gene Set Analysis.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2018

Prediction of transposable elements evolution using tabu search.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2018

2017
Deletion operations on deterministic families of automata.
Inf. Comput., 2017

Descrambling Order Analysis in Ciliates.
Proceedings of the Unconventional Computation and Natural Computation, 2017

CSA-X: Modularized Constrained Multiple Sequence Alignment.
Proceedings of the Algorithms for Computational Biology, 2017

2016
The effect of end-markers on counter machines and commutativity.
Theor. Comput. Sci., 2016

Computational modelling of interruptional activities between transposable elements using grammars and the linear ordering problem.
Soft Comput., 2016

On Bounded Semilinear Languages, Counter Machines, and Finite-Index ET0L.
Proceedings of the Implementation and Application of Automata, 2016

Computational identification of regions that influence activity of transposable elements in the human genome.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2016

2015
Simulation of the 2JLP Gene Assembly Process in Ciliates.
Proceedings of the Unconventional Computation and Natural Computation, 2015

2014
On Comparing Deterministic Finite Automata and the Shuffle of Words.
Proceedings of the Implementation and Application of Automata, 2014

2013
Computational Modelling of the Interruptional Activities between Transposable Elements.
Proceedings of the Theory and Practice of Natural Computing, 2013

2012
Algorithmic decomposition of shuffle on words.
Theor. Comput. Sci., 2012

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

Generalized Derivations with Synchronized Context-Free Grammars.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
Theoretical and computational properties of transpositions.
Nat. Comput., 2011

Parallelizing Peptide-Spectrum scoring using modern graphics processing units.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

2010
Algorithmic properties of ciliate sequence alignment.
Theor. Comput. Sci., 2010

Modelling programmed frameshifting with frameshift machines.
Nat. Comput., 2010

Speed improvements of peptide-spectrum matching using SIMD instructions.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2010

2009
On the uniqueness of shuffle on words and finite languages.
Theor. Comput. Sci., 2009

On the Shuffle Automaton Size for Words
Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

Homomorphisms Preserving Types of Density.
Acta Cybern., 2009

2008
The Bag Automaton: A Model of Nondeterministic Storage.
J. Autom. Lang. Comb., 2008

No Going Back: An Interactive Visualization Application for Trailblazing on the Web.
Proceedings of the 12th International Conference on Information Visualisation, 2008

2007
An infinite hierarchy induced by depth synchronization.
Theor. Comput. Sci., 2007

2006
Useful Templates and Iterated Template-Guided DNA Recombination in Ciliates.
Theory Comput. Syst., 2006

Iterated TGR Languages: Membership Problem and Effective Closure Properties.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
The generative capacity of block-synchronized context-free grammars.
Theor. Comput. Sci., 2005

Template-guided DNA recombination.
Theor. Comput. Sci., 2005

Formal modelling of viral gene compression.
Int. J. Found. Comput. Sci., 2005

On Computational Properties of Template-Guided DNA Recombination.
Proceedings of the DNA Computing, 11th International Workshop on DNA Computing, 2005

2004
Families of languages defined by ciliate bio-operations.
Theor. Comput. Sci., 2004

Descriptional Complexity of Block-Synchronization Context-Free Grammars.
J. Autom. Lang. Comb., 2004

Viral Gene Compression: Complexity and Verification.
Proceedings of the Implementation and Application of Automata, 2004

2003
The LD and DLAD Bio-Operations on Formal Languages.
J. Autom. Lang. Comb., 2003

Bag Automata and Stochastic Retrieval of Biomolecules in Solution.
Proceedings of the Implementation and Application of Automata, 2003


  Loading...