default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLloyd Allison
- > Home > Persons > Lloyd Allison
Publications
- 2010
[j32]Minh Duc Cao
, Trevor I. Dix, Lloyd Allison:
A genome alignment algorithm based on compression. BMC Bioinform. 11: 599 (2010)- 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 - 2004
- [c12]David R. Powell, Lloyd Allison, Trevor I. Dix:
Modelling-Alignment for Non-random Sequences. Australian Conference on Artificial Intelligence 2004: 203-214 - 2000
- [j27]Lloyd Allison, Linda Stern, Timothy Edgoose, Trevor I. Dix:
Sequence Complexity for Biological Sequence Analysis. Comput. Chem. 24(1): 43-55 (2000) - 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) - 1998
- [c5]David R. Powell, Lloyd Allison, Trevor I. Dix, David L. Dowe:
Alignment of Low Information Sequences. CATS 1998: 215-230 - [c3]Lloyd Allison, Timothy Edgoose, Trevor I. Dix:
Compression of Strings with Approximate Repeats. ISMB 1998: 8-16 - 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) - 1986
- [j8]Lloyd Allison, Trevor I. Dix:
A Bit-String Longest-Common-Subsequence Algorithm. Inf. Process. Lett. 23(6): 305-310 (1986)
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-08-05 21:24 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:
