Lloyd Allison

Orcid: 0000-0002-9020-3164

Affiliations:
  • Monash University, Melbourne, Australia


According to our database1, Lloyd Allison authored at least 77 papers between 1978 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The divergence time of protein structures modelled by Markov matrices and its relation to the divergence of sequences.
CoRR, 2023

Getting 'ϕψχal' with proteins: minimum message length inference of joint distributions of backbone and sidechain dihedral angles.
Bioinform., 2023

2022
Subclasses of Class Function used to Implement Transformations of Statistical Models.
CoRR, 2022

2021
The difficulty of being moral.
Theor. Comput. Sci., 2021

Causal KL: Evaluating Causal Discovery.
CoRR, 2021

Markov Blanket Discovery using Minimum Message Length.
CoRR, 2021

On Universal Codes for Integers: Wallace Tree, Elias Omega and Beyond.
Proceedings of the 31st Data Compression Conference, 2021

On identifying statistical redundancy at the level of amino acid subsequences.
Proceedings of the IEEE International Conference on Bioinformatics and Biomedicine, 2021

2020
Bridging the Gaps in Statistical Models of Protein Alignment.
CoRR, 2020

On the complexity of graphs (networks) by information content, and conditional (mutual) information given other graphs.
CoRR, 2020

2019
On Universal Codes for Integers: Wallace Tree, Elias Omega and Variations.
CoRR, 2019

Proving the NP-completeness of optimal moral graph triangulation.
CoRR, 2019

The Complexity of Morality: Checking Markov Blanket Consistency with DAGs via Morality.
CoRR, 2019

Statistical compression of protein sequences and inference of marginal probability landscapes over competing alignments using finite state models and Dirichlet priors.
Bioinform., 2019

2018
The Bits Between Proteins.
Proceedings of the 2018 Data Compression Conference, 2018

Coding Ockham's Razor
Springer, ISBN: 978-3-319-76432-0, 2018

2017
Statistical inference of protein structural alignments using information and compression.
Bioinform., 2017

Statistical Compression of Protein Folding Patterns for Inference of Recurrent Substructural Themes.
Proceedings of the 2017 Data Compression Conference, 2017

2015
Minimum message length estimation of mixtures of multivariate Gaussian and von Mises-Fisher distributions.
Mach. Learn., 2015

On Sufficient Statistics of Least-Squares Superposition of Vector Sets.
J. Comput. Biol., 2015

2014
A new statistical framework to assess structural alignment quality using information compression.
Bioinform., 2014

A Statistically Efficient and Scalable Method for Log-Linear Analysis of High-Dimensional Data.
Proceedings of the 2014 IEEE International Conference on Data Mining, 2014

2013
Statistical Inference of Protein "LEGO Bricks".
Proceedings of the 2013 IEEE 13th International Conference on Data Mining, 2013

2012
Minimum message length inference of secondary structure from protein coordinate data.
Bioinform., 2012

2011
Piecewise linear approximation of protein structures using the principle of minimum message length.
Bioinform., 2011

MMLD Inference of Multilayer Perceptrons.
Proceedings of the Algorithmic Probability and Friends. Bayesian Prediction and Artificial Intelligence, 2011

2010
A genome alignment algorithm based on compression.
BMC Bioinform., 2010

Design of an Efficient Out-of-Core Read Alignment Algorithm.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

2009
Computing Substitution Matrices for Genomic Comparative Analysis.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2009

A Distance Measure for Genome Phylogenetic Analysis.
Proceedings of the AI 2009: Advances in Artificial Intelligence, 2009

Modelling Hepatitis B Virus Antiviral Therapy and Drug Resistant Mutant Strains.
Proceedings of the Artificial Life: Borrowing from Biology, 4th Australian Conference, 2009

2007
Comparative analysis of long DNA sequences by per element information content using different contexts.
BMC Bioinform., 2007

A Simple Statistical Algorithm for Biological Sequence Compression.
Proceedings of the 2007 Data Compression Conference (DCC 2007), 2007

2006
Learning Hybrid Bayesian Networks by MML.
Proceedings of the AI 2006: Advances in Artificial Intelligence, 2006

A programming paradigm for machine learning, with a case study of Bayesian networks.
Proceedings of the Computer Science 2006, 2006

2005
Models for machine learning and data mining in functional programming.
J. Funct. Program., 2005

2004
Modelling-Alignment for Non-random Sequences.
Proceedings of the AI 2004: Advances in Artificial Intelligence, 2004

2003
Longest Biased Interval and Longest Non-negative Sum Interval.
Bioinform., 2003

Probability Model Type Sufficiency.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2003

Flexible Decision Trees in a General Data-Mining Environment.
Proceedings of the Intelligent Data Engineering and Automated Learning, 2003

Types and Classes of Machine Learning and Data Mining.
Proceedings of the Computer Science 2003, 2003

2002
Change-Point Estimation Using New Minimum Message Length Approximations.
Proceedings of the PRICAI 2002: Trends in Artificial Intelligence, 2002

Univariate Polynomial Inference by Monte Carlo Message Length Approximation.
Proceedings of the Machine Learning, 2002

2000
Sequence Complexity for Biological Sequence Analysis.
Comput. Chem., 2000

Intelligent Systems in Molecular Biology (ISMB98), 27 June - 1 July, 1998, Montreal.
Comput. Chem., 2000

Generator and Search Objects in Java.
J. Res. Pract. Inf. Technol., 2000

Minimum Message Length Grouping of Ordered Data.
Proceedings of the Algorithmic Learning Theory, 11th International Conference, 2000

1999
MML Markov classification of sequential data.
Stat. Comput., 1999

A Versatile Divide and Conquer Technique for Optimal String Alignment.
Inf. Process. Lett., 1999

Compression and Approximate Matching.
Comput. J., 1999

1998
What is a Tall Poppy Among Web Pages?
Comput. Networks, 1998

The Hunter and the Hunted - Modelling the Relationship Between Web Pages and Search Engines.
Proceedings of the Research and Development in Knowledge Discovery and Data Mining, 1998

Compression of Strings with Approximate Repeats.
Proceedings of the 6th International Conference on Intelligent Systems for Molecular Biology (ISMB-98), Montréal, Québec, Canada, June 28, 1998

Minimum Message Length Hidden Markov Modelling.
Proceedings of the Data Compression Conference, 1998

Alignment of Low Information Sequences.
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), 1998

1994
Using Hirschberg's Algorithm to Generate Random Alignments of Strings.
Inf. Process. Lett., 1994

Motifs in Biology: Analysis of Ambiguous Data: Introduction.
Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

1993
A Correction to the Denotational Semantics for the Prolog of Nicholson and Foo.
ACM Trans. Program. Lang. Syst., 1993

Reconstruction of strings past.
Comput. Appl. Biosci., 1993

Applications of Recursively Defined Data Structures.
Aust. Comput. J., 1993

1992
Lazy Dynamic-Programming Can Be Eager.
Inf. Process. Lett., 1992

1991
Shortest Path and Closure Algorithms for Banded Matrices.
Inf. Process. Lett., 1991

1990
Continuations Implement Generators and Streams.
Comput. J., 1990

Restriction site mapping for three or more enzymes.
Comput. Appl. Biosci., 1990

1989
Circular Programs and Self-referential Structures.
Softw. Pract. Exp., 1989

Direct Semantics and Exceptions Define Jumps and Coroutines.
Inf. Process. Lett., 1989

Denotational Semantics of a Command Interpreter and Their Implementation in Standard ML.
Comput. J., 1989

1988
Some Applications of Continuations.
Comput. J., 1988

Restriction site mapping is in separation theory.
Comput. Appl. Biosci., 1988

1986
A Bit-String Longest-Common-Subsequence Algorithm.
Inf. Process. Lett., 1986

1985
Programming Denotational Semantics II.
Comput. J., 1985

1983
Syntax Directed Program Editing.
Softw. Pract. Exp., 1983

Stable Marriages by Coroutines.
Inf. Process. Lett., 1983

Programming Denotational Semantics.
Comput. J., 1983

1981
Generating Coset Representatives for Permutation Groups.
J. Algorithms, 1981

1978
On nondeterministic control structures.
ACM SIGPLAN Notices, 1978

Phrase Structures, Non-Determinism and Backtracking.
Inf. Process. Lett., 1978


  Loading...