Остановите войну!
for scientists:
default search action
Lloyd Allison
Person information
- affiliation: Monash University, Melbourne, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i12]Lloyd Allison:
Circular Programs and Self-Referential Structures. CoRR abs/2403.01866 (2024) - 2023
- [j41]Piyumi R. Amarasinghe, Lloyd Allison, Peter J. Stuckey, Maria Garcia de la Banda, Arthur M. Lesk, Arun Siddharth Konagurthu:
Getting 'ϕψχal' with proteins: minimum message length inference of joint distributions of backbone and sidechain dihedral angles. Bioinform. 39(Supplement-1): 357-367 (2023) - [i11]Sandun Rajapaksa, Lloyd Allison, Peter J. Stuckey, Maria Garcia de la Banda, Arun Siddharth Konagurthu:
The divergence time of protein structures modelled by Markov matrices and its relation to the divergence of sequences. CoRR abs/2308.06292 (2023) - 2022
- [i10]Lloyd Allison:
Applications of Recursively Defined Data Structures. CoRR abs/2206.12795 (2022) - [i9]Lloyd Allison:
Subclasses of Class Function used to Implement Transformations of Statistical Models. CoRR abs/2207.04218 (2022) - 2021
- [j40]Yang Li, Lloyd Allison, Kevin B. Korb:
The difficulty of being moral. Theor. Comput. Sci. 885: 77-90 (2021) - [c27]Sandun Rajapaksa, Dinithi Sumanaweera, Maria Garcia de la Banda, Peter J. Stuckey, David Abramson, Lloyd Allison, Arthur M. Lesk, Arun Siddharth Konagurthu:
On identifying statistical redundancy at the level of amino acid subsequences. BIBM 2021: 64-71 - [c26]Lloyd Allison, Arun Siddharth Konagurthu, Daniel F. Schmidt:
On Universal Codes for Integers: Wallace Tree, Elias Omega and Beyond. DCC 2021: 313-322 - [i8]Yang Li, Kevin B. Korb, Lloyd Allison:
Markov Blanket Discovery using Minimum Message Length. CoRR abs/2107.08140 (2021) - [i7]Rodney T. O'Donnell, Kevin B. Korb, Lloyd Allison:
Causal KL: Evaluating Causal Discovery. CoRR abs/2111.06029 (2021) - 2020
- [i6]Lloyd Allison:
On the complexity of graphs (networks) by information content, and conditional (mutual) information given other graphs. CoRR abs/2008.04744 (2020) - [i5]Dinithi Sumanaweera, Lloyd Allison, Arun Siddharth Konagurthu:
Bridging the Gaps in Statistical Models of Protein Alignment. CoRR abs/2010.00855 (2020)
2010 – 2019
- 2019
- [j39]Dinithi Sumanaweera, Lloyd Allison, Arun Siddharth Konagurthu:
Statistical compression of protein sequences and inference of marginal probability landscapes over competing alignments using finite state models and Dirichlet priors. Bioinform. 35(14): i360-i369 (2019) - [i4]Yang Li, Kevin B. Korb, Lloyd Allison:
The Complexity of Morality: Checking Markov Blanket Consistency with DAGs via Morality. CoRR abs/1903.01707 (2019) - [i3]Yang Li, Lloyd Allison, Kevin B. Korb:
Proving the NP-completeness of optimal moral graph triangulation. CoRR abs/1903.02201 (2019) - [i2]Lloyd Allison, Arun Siddharth Konagurthu, Daniel F. Schmidt:
On Universal Codes for Integers: Wallace Tree, Elias Omega and Variations. CoRR abs/1906.05004 (2019) - 2018
- [b1]Lloyd Allison:
Coding Ockham's Razor. Springer 2018, ISBN 978-3-319-76432-0, pp. 1-175 - [c25]Dinithi Sumanaweera, Lloyd Allison, Arun Siddharth Konagurthu:
The Bits Between Proteins. DCC 2018: 177-186 - 2017
- [j38]James H. Collier, Lloyd Allison, Arthur M. Lesk, Peter J. Stuckey, Maria Garcia de la Banda, Arun Siddharth Konagurthu:
Statistical inference of protein structural alignments using information and compression. Bioinform. 33(7): 1005-1013 (2017) - [c24]Ramanan Subramanian, Lloyd Allison, Peter J. Stuckey, Maria Garcia de la Banda, David Abramson, Arthur M. Lesk, Arun Siddharth Konagurthu:
Statistical Compression of Protein Folding Patterns for Inference of Recurrent Substructural Themes. DCC 2017: 340-349 - 2015
- [j37]Arun Siddharth Konagurthu, Parthan Kasarapu, Lloyd Allison, James H. Collier, Arthur M. Lesk:
On Sufficient Statistics of Least-Squares Superposition of Vector Sets. J. Comput. Biol. 22(6): 487-497 (2015) - [j36]Parthan Kasarapu, Lloyd Allison:
Minimum message length estimation of mixtures of multivariate Gaussian and von Mises-Fisher distributions. Mach. Learn. 100(2-3): 333-378 (2015) - [i1]Parthan Kasarapu, Lloyd Allison:
Minimum message length estimation of mixtures of multivariate Gaussian and von Mises-Fisher distributions. CoRR abs/1502.07813 (2015) - 2014
- [j35]James H. Collier, Lloyd Allison, Arthur M. Lesk, Maria Garcia de la Banda, Arun Siddharth Konagurthu:
A new statistical framework to assess structural alignment quality using information compression. Bioinform. 30(17): 512-518 (2014) - [c23]François Petitjean, Lloyd Allison, Geoffrey I. Webb:
A Statistically Efficient and Scalable Method for Log-Linear Analysis of High-Dimensional Data. ICDM 2014: 480-489 - [c22]Arun Siddharth Konagurthu, Parthan Kasarapu, Lloyd Allison, James H. Collier, Arthur M. Lesk:
On Sufficient Statistics of Least-Squares Superposition of Vector Sets. RECOMB 2014: 144-159 - 2013
- [c21]Arun Siddharth Konagurthu, Lloyd Allison, David Abramson, Peter J. Stuckey, Arthur M. Lesk:
Statistical Inference of Protein "LEGO Bricks". ICDM 2013: 1091-1096 - 2012
- [j34]Arun Siddharth Konagurthu, Arthur M. Lesk, Lloyd Allison:
Minimum message length inference of secondary structure from protein coordinate data. Bioinform. 28(12): 97-105 (2012) - 2011
- [j33]Arun Siddharth Konagurthu, Lloyd Allison, Peter J. Stuckey, Arthur M. Lesk:
Piecewise linear approximation of protein structures using the principle of minimum message length. Bioinform. 27(13): 43-51 (2011) - [c20]Enes Makalic, Lloyd Allison:
MMLD Inference of Multilayer Perceptrons. Algorithmic Probability and Friends 2011: 261-272 - 2010
- [j32]Minh Duc Cao, Trevor I. Dix, Lloyd Allison:
A genome alignment algorithm based on compression. BMC Bioinform. 11: 599 (2010) - [c19]Arun Siddharth Konagurthu, Lloyd Allison, Thomas C. Conway, Bryan Beresford-Smith, Justin Zobel:
Design of an Efficient Out-of-Core Read Alignment Algorithm. WABI 2010: 189-201
2000 – 2009
- 2009
- [c18]Julie Bernal, Trevor I. Dix, Lloyd Allison, Angeline Bartholomeusz, Lilly Yuen:
Modelling Hepatitis B Virus Antiviral Therapy and Drug Resistant Mutant Strains. ACAL 2009: 159-168 - [c17]Minh Duc Cao, Lloyd Allison, Trevor I. Dix:
A Distance Measure for Genome Phylogenetic Analysis. Australasian Conference on Artificial Intelligence 2009: 71-80 - [c16]Minh Duc Cao, Trevor I. Dix, Lloyd Allison:
Computing Substitution Matrices for Genomic Comparative Analysis. PAKDD 2009: 647-655 - 2007
- [j31]Trevor I. Dix, David R. Powell, Lloyd Allison, Julie Bernal, Samira Jaeger, Linda Stern:
Comparative analysis of long DNA sequences by per element information content using different contexts. BMC Bioinform. 8(S-2) (2007) - [c15]Minh Duc Cao, Trevor I. Dix, Lloyd Allison, Chris Mears:
A Simple Statistical Algorithm for Biological Sequence Compression. DCC 2007: 43-52 - 2006
- [c14]Lloyd Allison:
A programming paradigm for machine learning, with a case study of Bayesian networks. ACSC 2006: 103-111 - [c13]Rodney T. O'Donnell, Lloyd Allison, Kevin B. Korb:
Learning Hybrid Bayesian Networks by MML. Australian Conference on Artificial Intelligence 2006: 192-203 - 2005
- [j30]Lloyd Allison:
Models for machine learning and data mining in functional programming. J. Funct. Program. 15(1): 15-32 (2005) - 2004
- [c12]David R. Powell, Lloyd Allison, Trevor I. Dix:
Modelling-Alignment for Non-random Sequences. Australian Conference on Artificial Intelligence 2004: 203-214 - 2003
- [j29]Lloyd Allison:
Longest Biased Interval and Longest Non-negative Sum Interval. Bioinform. 19(10): 1294-1295 (2003) - [c11]Lloyd Allison:
Types and Classes of Machine Learning and Data Mining. ACSC 2003: 207-215 - [c10]Leigh J. Fitzgibbon, Lloyd Allison, Joshua W. Comley:
Probability Model Type Sufficiency. IDEAL 2003: 530-534 - [c9]Joshua W. Comley, Lloyd Allison, Leigh J. Fitzgibbon:
Flexible Decision Trees in a General Data-Mining Environment. IDEAL 2003: 761-767 - 2002
- [c8]Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison:
Univariate Polynomial Inference by Monte Carlo Message Length Approximation. ICML 2002: 147-154 - [c7]Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison:
Change-Point Estimation Using New Minimum Message Length Approximations. PRICAI 2002: 244-254 - 2000
- [j28]Lloyd Allison:
Generator and Search Objects in Java. J. Res. Pract. Inf. Technol. 32(1): 3-12 (2000) - [j27]Lloyd Allison, Linda Stern, Timothy Edgoose, Trevor I. Dix:
Sequence Complexity for Biological Sequence Analysis. Comput. Chem. 24(1): 43-55 (2000) - [j26]Lloyd Allison:
Intelligent Systems in Molecular Biology (ISMB98), 27 June - 1 July, 1998, Montreal. Comput. Chem. 24(1): 129-132 (2000) - [c6]Leigh J. Fitzgibbon, Lloyd Allison, David L. Dowe:
Minimum Message Length Grouping of Ordered Data. ALT 2000: 56-70
1990 – 1999
- 1999
- [j25]Lloyd Allison, David R. Powell, Trevor I. Dix:
Compression and Approximate Matching. Comput. J. 42(1): 1-10 (1999) - [j24]David R. Powell, Lloyd Allison, Trevor I. Dix:
A Versatile Divide and Conquer Technique for Optimal String Alignment. Inf. Process. Lett. 70(3): 127-139 (1999) - [j23]Timothy Edgoose, Lloyd Allison:
MML Markov classification of sequential data. Stat. Comput. 9(4): 269-278 (1999) - 1998
- [j22]Glen Pringle, Lloyd Allison, David L. Dowe:
What is a Tall Poppy Among Web Pages? Comput. Networks 30(1-7): 369-377 (1998) - [c5]David R. Powell, Lloyd Allison, Trevor I. Dix, David L. Dowe:
Alignment of Low Information Sequences. CATS 1998: 215-230 - [c4]Timothy Edgoose, Lloyd Allison:
Minimum Message Length Hidden Markov Modelling. Data Compression Conference 1998: 169-178 - [c3]Lloyd Allison, Timothy Edgoose, Trevor I. Dix:
Compression of Strings with Approximate Repeats. ISMB 1998: 8-16 - [c2]David L. Dowe, Lloyd Allison, Glen Pringle:
The Hunter and the Hunted - Modelling the Relationship Between Web Pages and Search Engines. PAKDD 1998: 380-382 - 1994
- [j21]Lloyd Allison:
Using Hirschberg's Algorithm to Generate Random Alignments of Strings. Inf. Process. Lett. 51(5): 251-255 (1994) - [c1]Toni Kazic, David J. States, Lloyd Allison:
Motifs in Biology: Analysis of Ambiguous Data: Introduction. HICSS (5) 1994: 224 - 1993
- [j20]Lloyd Allison:
Applications of Recursively Defined Data Structures. Aust. Comput. J. 25(1): 14-20 (1993) - [j19]Chut N. Yee, Lloyd Allison:
Reconstruction of strings past. Comput. Appl. Biosci. 9(1): 1-7 (1993) - [j18]Alan Finlay, Lloyd Allison:
A Correction to the Denotational Semantics for the Prolog of Nicholson and Foo. ACM Trans. Program. Lang. Syst. 15(1): 206-208 (1993) - 1992
- [j17]Lloyd Allison:
Lazy Dynamic-Programming Can Be Eager. Inf. Process. Lett. 43(4): 207-212 (1992) - 1991
- [j16]Lloyd Allison, Trevor I. Dix, Chut N. Yee:
Shortest Path and Closure Algorithms for Banded Matrices. Inf. Process. Lett. 40(6): 317-322 (1991) - 1990
- [j15]S. T. Ho, Lloyd Allison, Chut N. Yee:
Restriction site mapping for three or more enzymes. Comput. Appl. Biosci. 6(3): 195-204 (1990) - [j14]Lloyd Allison:
Continuations Implement Generators and Streams. Comput. J. 33(5): 460-465 (1990)
1980 – 1989
- 1989
- [j13]C. McDonald, Lloyd Allison:
Denotational Semantics of a Command Interpreter and Their Implementation in Standard ML. Comput. J. 32(5): 422-431 (1989) - [j12]Lloyd Allison:
Direct Semantics and Exceptions Define Jumps and Coroutines. Inf. Process. Lett. 31(6): 327-330 (1989) - [j11]Lloyd Allison:
Circular Programs and Self-referential Structures. Softw. Pract. Exp. 19(2): 99-109 (1989) - 1988
- [j10]Lloyd Allison, Chut N. Yee:
Restriction site mapping is in separation theory. Comput. Appl. Biosci. 4(1): 97-101 (1988) - [j9]Lloyd Allison:
Some Applications of Continuations. Comput. J. 31(1): 9-11 (1988) - 1986
- [j8]Lloyd Allison, Trevor I. Dix:
A Bit-String Longest-Common-Subsequence Algorithm. Inf. Process. Lett. 23(6): 305-310 (1986) - 1985
- [j7]Lloyd Allison:
Programming Denotational Semantics II. Comput. J. 28(5): 480-486 (1985) - 1983
- [j6]Lloyd Allison:
Programming Denotational Semantics. Comput. J. 26(2): 164-174 (1983) - [j5]Lloyd Allison:
Stable Marriages by Coroutines. Inf. Process. Lett. 16(2): 61-65 (1983) - [j4]Lloyd Allison:
Syntax Directed Program Editing. Softw. Pract. Exp. 13(5): 453-465 (1983) - 1981
- [j3]Lloyd Allison:
Generating Coset Representatives for Permutation Groups. J. Algorithms 2(3): 227-244 (1981)
1970 – 1979
- 1978
- [j2]Lloyd Allison:
Phrase Structures, Non-Determinism and Backtracking. Inf. Process. Lett. 7(3): 139-143 (1978) - [j1]Lloyd Allison:
On nondeterministic control structures. ACM SIGPLAN Notices 13(7): 18-20 (1978)
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-05-08 21:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint