Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Amanda Clare

dblp:c/AmandaClare · DBLP profile ↗
← Back
23ranked-venue papers
8as first author
3since 2021 · last 2022
0000-0001-8315-3659ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 12 · 3 first-author · 2 since 2021Artificial intelligence and machine learning · 9 · 2 first-author · 1 since 2021Databases, data management, data science and information retrieval · 5 · 3 first-authorSoftware engineering, systems software and programming languages · 2 · 2 first-authorTheory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
10 papers
Bioinformatics and computational biology · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 16 heaviest of 17, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genomics
computational genomics
0.822021
On the complexity of haplotyping a microbial community · Bioinform. 2021
Goldilocks: a tool for identifying genomic regions that are 'just right' · Bioinform. 2016
Bioinformatics and computational biology
genomics
0.622022
No one tool to rule them all: prokaryotic gene prediction tool annotations are highly dependent on the organism of study · Bioinform. 2022
Genome scale prediction of protein functional class from sequence using data mining · KDD 2000
Bioinformatics and computational biology › genome annotation
gene prediction
0.612022
No one tool to rule them all: prokaryotic gene prediction tool annotations are highly dependent on the organism of study · Bioinform. 2022
Bioinformatics and computational biology › genome annotation › gene prediction
prokaryotic gene prediction
0.612022
No one tool to rule them all: prokaryotic gene prediction tool annotations are highly dependent on the organism of study · Bioinform. 2022
Bioinformatics and computational biology
metagenomics
0.512021
On the complexity of haplotyping a microbial community · Bioinform. 2021
Bioinformatics and computational biology › genomics
genomic region analysis
0.212016
Goldilocks: a tool for identifying genomic regions that are 'just right' · Bioinform. 2016
Bioinformatics and computational biology
protein function prediction
0.242006
Functional bioinformatics for Arabidopsis thaliana · Bioinform. 2006
Confirmation of data mining based predictions of protein function · Bioinform. 2004
The utility of different representations of protein sequence for predicting functional class · Bioinform. 2001
Bioinformatics and computational biology
laboratory information management
0.112012
AutoLabDB: a substantial open source database schema to support a high-throughput automated laboratory · Bioinform. 2012
Bioinformatics and computational biology › genome annotation
functional annotation
0.112006
Functional bioinformatics for Arabidopsis thaliana · Bioinform. 2006
Data mining › pattern mining
association rule mining
0.012004
Scalable Multi-Relational Association Mining · ICDM 2004
Bioinformatics and computational biology › drug discovery
high-throughput screening
0.012012
AutoLabDB: a substantial open source database schema to support a high-throughput automated laboratory · Bioinform. 2012
Bioinformatics and computational biology › protein function prediction › protein classification
functional class prediction
0.012002
Machine learning of functional class from phenotype data · Bioinform. 2002
Bioinformatics and computational biology
functional genomics
0.012002
Machine learning of functional class from phenotype data · Bioinform. 2002
Knowledge, reasoning and agents › Knowledge representation and reasoning
ontology
0.012008
The EXACT description of biomedical protocols · ISMB 2008
Bioinformatics and computational biology › genomics
plant genomics
0.012006
Functional bioinformatics for Arabidopsis thaliana · Bioinform. 2006
Data mining › big data analytics
large-scale data mining
0.012004
Scalable Multi-Relational Association Mining · ICDM 2004

Methods — techniques the papers use, named apart from their topics

performance metrics · 0.6benchmarking · 0.6pairwise SNV co-occurrence matrix · 0.5greedy graph traversal · 0.5sliding window analysis · 0.2outlier detection · 0.2ontology engineering · 0.2database design · 0.1data mining · 0.1decision tree · 0.1RADAR · 0.0
YearPublicationVenuePosition
2022 No one tool to rule them all: prokaryotic gene prediction tool annotations are highly dependent on the organism of study
abstract
MOTIVATION: The biases in CoDing Sequence (CDS) prediction tools, which have been based on historic genomic annotations from model organisms, impact our understanding of novel genomes and metagenomes. This hinders the discovery of new genomic information as it results in predictions being biased towards existing knowledge. To date, users have lacked a systematic and replicable approach to identify the strengths and weaknesses of any CDS prediction tool and allow them to choose the right tool for their analysis. RESULTS: We present an evaluation framework (ORForise) based on a comprehensive set of 12 primary and 60 secondary metrics that facilitate the assessment of the performance of CDS prediction tools. This makes it possible to identify which performs better for specific use-cases. We use this to assess 15 ab initio- and model-based tools representing those most widely used (historically and currently) to generate the knowledge in genomic databases. We find that the performance of any tool is dependent on the genome being analysed, and no individual tool ranked as the most accurate across all genomes or metrics analysed. Even the top-ranked tools produced conflicting gene collections, which could not be resolved by aggregation. The ORForise evaluation framework provides users with a replicable, data-led approach to make informed tool choices for novel genome annotations and for refining historical annotations. AVAILABILITY AND IMPLEMENTATION: Code and datasets for reproduction and customisation are available at https://github.com/NickJD/ORForise. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Nicholas J. Dimonaco, Wayne Aubrey, Kim Kenobi, Amanda Clare, Christopher J. Creevey
Bioinform.4
2021 CD\^2CR: Co-reference resolution across documents and domains
abstract
Cross-document co-reference resolution (CDCR) is the task of identifying and linking mentions to entities and concepts across many text documents.Current state-of-the-art models for this task assume that all documents are of the same type (e.g.news articles) or fall under the same theme.However, it is also desirable to perform CDCR across different domains (type or theme).A particular use case we focus on in this paper is the resolution of entities mentioned across scientific work and newspaper articles that discuss them.Identifying the same entities and corresponding concepts in both scientific articles and news can help scientists understand how their work is represented in mainstream media.We propose a new task and English language dataset for cross-document cross-domain co-reference resolution (CD 2 CR).The task aims to identify links between entities across heterogeneous document types.We show that in this cross-domain, cross-document setting, existing CDCR models do not perform well and we provide a baseline model that outperforms current state-of-the-art CDCR models on CD 2 CR.Our data set, annotation tool and guidelines as well as our model for cross-document cross-domain co-reference are all supplied as open access open source resources.
James Ravenscroft, Amanda Clare, Arie Cattan, Ido Dagan, Maria Liakata
EACL2
2021 On the complexity of haplotyping a microbial community
abstract
MOTIVATION: Population-level genetic variation enables competitiveness and niche specialization in microbial communities. Despite the difficulty in culturing many microbes from an environment, we can still study these communities by isolating and sequencing DNA directly from an environment (metagenomics). Recovering the genomic sequences of all isoforms of a given gene across all organisms in a metagenomic sample would aid evolutionary and ecological insights into microbial ecosystems with potential benefits for medicine and biotechnology. A significant obstacle to this goal arises from the lack of a computationally tractable solution that can recover these sequences from sequenced read fragments. This poses a problem analogous to reconstructing the two sequences that make up the genome of a diploid organism (i.e. haplotypes) but for an unknown number of individuals and haplotypes. RESULTS: The problem of single individual haplotyping was first formalized by Lancia et al. in 2001. Now, nearly two decades later, we discuss the complexity of 'haplotyping' metagenomic samples, with a new formalization of Lancia et al.'s data structure that allows us to effectively extend the single individual haplotype problem to microbial communities. This work describes and formalizes the problem of recovering genes (and other genomic subsequences) from all individuals within a complex community sample, which we term the metagenomic individual haplotyping problem. We also provide software implementations for a pairwise single nucleotide variant (SNV) co-occurrence matrix and greedy graph traversal algorithm. AVAILABILITY AND IMPLEMENTATION: Our reference implementation of the described pairwise SNV matrix (Hansel) and greedy haplotype path traversal algorithm (Gretel) is open source, MIT licensed and freely available online at github.com/samstudio8/hansel and github.com/samstudio8/gretel, respectively.
Samuel M. Nicholls, Wayne Aubrey, Kurt De Grave, Leander Schietgat, Christopher J. Creevey, Amanda Clare
Bioinform.6
2020 Evaluation of a Permutation-Based Evolutionary Framework for Lyndon Factorizations
Lily Major, Amanda Clare, Jacqueline W. Daykin, Benjamin Mora, Leonel Jose Peña Gamboa, Christine Zarges
PPSN (1)2
2019 Enhanced string factoring from alphabet orderings
abstract
In this note we consider the concept of alphabet ordering in the context of string factoring. We propose a greedy algorithm that produces Lyndon factorizations with small numbers of factors which can be modified to produce large numbers of factors. For the technique we introduce the Exponent Parikh vector. Applications and research directions derived from circ-UMFFs are discussed.
Amanda Clare, Jacqueline W. Daykin
Inf. Process. Lett.1
2016 Applying Core Scientific Concepts to Context-Based Citation Recommendation
Daniel Duma, Maria Liakata, Amanda Clare, James Ravenscroft, Ewan Klein
LREC3
2016 Goldilocks: a tool for identifying genomic regions that are 'just right'
abstract
UNLABELLED: : We present Goldilocks: a Python package providing functionality for collecting summary statistics, identifying shifts in variation, discovering outlier regions and locating and extracting interesting regions from one or more arbitrary genomes for further analysis, for a user-provided definition of interesting. AVAILABILITY AND IMPLEMENTATION: Goldilocks is freely available open-source software distributed under the MIT licence. Source code is hosted publicly at https://github.com/SamStudio8/goldilocks and the package may also be installed using pip install goldilocks. Documentation can be found at https://goldilocks.readthedocs.org CONTACT: : [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Samuel M. Nicholls, Amanda Clare, Joshua C. Randall
Bioinform.2
2015 Review of "A functional start to computing with Python", Ted Herman, CRC Press, 2014, ISBN 978-1-4665-0455-4
Amanda Clare
J. Funct. Program.1
2012 AutoLabDB: a substantial open source database schema to support a high-throughput automated laboratory
abstract
Abstract Motivation: Modern automated laboratories need substantial data management solutions to both store and make accessible the details of the experiments they perform. To be useful, a modern Laboratory Information Management System (LIMS) should be flexible and easily extensible to support evolving laboratory requirements, and should be based on the solid foundations of a robust, well-designed database. We have developed such a database schema to support an automated laboratory that performs experiments in systems biology and high-throughput screening. Results: We describe the design of the database schema (AutoLabDB), detailing the main features and describing why we believe it will be relevant to LIMS manufacturers or custom builders. This database has been developed to support two large automated Robot Scientist systems over the last 5 years, where it has been used as the basis of an LIMS that helps to manage both the laboratory and all the experiment data produced. Availability and implementation: The database schema has been made available as open source (BSD license), so that others may use, extend and improve it to meet their own needs. Example software interfaces to the database are also provided. http://autolabdb.sourceforge.net/ Contact: [email protected]
Andrew Sparkes, Amanda Clare
Bioinform.2
2008 The EXACT description of biomedical protocols
abstract
MOTIVATION: Many published manuscripts contain experiment protocols which are poorly described or deficient in information. This means that the published results are very hard or impossible to repeat. This problem is being made worse by the increasing complexity of high-throughput/automated methods. There is therefore a growing need to represent experiment protocols in an efficient and unambiguous way. RESULTS: We have developed the Experiment ACTions (EXACT) ontology as the basis of a method of representing biological laboratory protocols. We provide example protocols that have been formalized using EXACT, and demonstrate the advantages and opportunities created by using this formalization. We argue that the use of EXACT will result in the publication of protocols with increased clarity and usefulness to the scientific community. AVAILABILITY: The ontology, examples and code can be downloaded from http://www.aber.ac.uk/compsci/Research/bio/dss/EXACT/.
Larisa N. Soldatova, Wayne Aubrey, Ross D. King, Amanda Clare
ISMB4
2007 Locational distribution of gene functional classes in Arabidopsis thaliana
abstract
BACKGROUND: We are interested in understanding the locational distribution of genes and their functions in genomes, as this distribution has both functional and evolutionary significance. Gene locational distribution is known to be affected by various evolutionary processes, with tandem duplication thought to be the main process producing clustering of homologous sequences. Recent research has found clustering of protein structural families in the human genome, even when genes identified as tandem duplicates have been removed from the data. However, this previous research was hindered as they were unable to analyse small sample sizes. This is a challenge for bioinformatics as more specific functional classes have fewer examples and conventional statistical analyses of these small data sets often produces unsatisfactory results. RESULTS: We have developed a novel bioinformatics method based on Monte Carlo methods and Greenwood's spacing statistic for the computational analysis of the distribution of individual functional classes of genes (from GO). We used this to make the first comprehensive statistical analysis of the relationship between gene functional class and location on a genome. Analysis of the distribution of all genes except tandem duplicates on the five chromosomes of A. thaliana reveals that the distribution on chromosomes I, II, IV and V is clustered at P = 0.001. Many functional classes are clustered, with the degree of clustering within an individual class generally consistent across all five chromosomes. A novel and surprising result was that the locational distribution of some functional classes were significantly more evenly spaced than would be expected by chance. CONCLUSION: Analysis of the A. thaliana genome reveals evidence of unexplained order in the locational distribution of genes. The same general analysis method can be applied to any genome, and indeed any sequential data involving classes.
Michael C. Riley, Amanda Clare, Ross D. King
BMC Bioinform.2
2006 Decision Trees for Hierarchical Multilabel Classification: A Case Study in Functional Genomics
Hendrik Blockeel, Leander Schietgat, Jan Struyf, Saso Dzeroski, Amanda Clare
PKDD5
2006 Functional bioinformatics for Arabidopsis thaliana
abstract
MOTIVATION: The genome of Arabidopsis thaliana, which has the best understood plant genome, still has approximately one-third of its genes with no functional annotation at all from either MIPS or TAIR. We have applied our Data Mining Prediction (DMP) method to the problem of predicting the functional classes of these protein sequences. This method is based on using a hybrid machine-learning/data-mining method to identify patterns in the bioinformatic data about sequences that are predictive of function. We use data about sequence, predicted secondary structure, predicted structural domain, InterPro patterns, sequence similarity profile and expressions data. RESULTS: We predicted the functional class of a high percentage of the Arabidopsis genes with currently unknown function. These predictions are interpretable and have good test accuracies. We describe in detail seven of the rules produced.
Amanda Clare, Andreas Karwath, Helen Ougham, Ross D. King
Bioinform.1
2006 Functional bioinformatics for Arabidopsis thaliana
abstract
The authors would like to apologise for an error in citing H. Ougham's affiliated institution. It should be IGER, Plas Gogerddan, Aberystwyth, Ceredigion SY23 3EB, UK.
Amanda Clare, Andreas Karwath, Helen Ougham, Ross D. King
Bioinform.1
2005 The Robot Scientist Project
Ross D. King, Amanda Clare, Kenneth Whelan, Jem J. Rowland
Discovery Science3
2004 Scalable Multi-Relational Association Mining
abstract
We propose the RADAR technique for multirelational data mining. This permits the mining of very large collections and provides a technique for discovering multirelational associations. Results show that RADAR is reliable and scalable for mining a large yeast homology collection, and that it does not have the main-memory scalability constraints of the Farmer and Warmr tools.
Amanda Clare, Hugh E. Williams, Nicholas Lester
ICDM1
2004 Confirmation of data mining based predictions of protein function
abstract
MOTIVATION: A central problem in bioinformatics is the assignment of function to sequenced open reading frames (ORFs). The most common approach is based on inferred homology using a statistically based sequence similarity (SIM) method, e.g. PSI-BLAST. Alternative non-SIM based bioinformatic methods are becoming popular. One such method is Data Mining Prediction (DMP). This is based on combining evidence from amino-acid attributes, predicted structure and phylogenic patterns; and uses a combination of Inductive Logic Programming data mining, and decision trees to produce prediction rules for functional class. DMP predictions are more general than is possible using homology. In 2000/1, DMP was used to make public predictions of the function of 1309 Escherichia coli ORFs. Since then biological knowledge has advanced allowing us to test our predictions. RESULTS: We examined the updated (20.02.02) Riley group genome annotation, and examined the scientific literature for direct experimental derivations of ORF function. Both tests confirmed the DMP predictions. Accuracy varied between rules, and with the detail of prediction, but they were generally significantly better than random. For voting rules, accuracies of 75-100% were obtained. Twenty-one of these DMP predictions have been confirmed by direct experimentation. The DMP rules also have interesting biological explanations. DMP is, to the best of our knowledge, the first non-SIM based prediction method to have been tested directly on new data. AVAILABILITY: We have designed the "Genepredictions" database for protein functional predictions. This is intended to act as an open repository for predictions for any organism and can be accessed at http://www.genepredictions.org
Ross D. King, Paul H. Wise, Amanda Clare
Bioinform.3
2003 Data Mining the Yeast Genome in a Lazy Functional Language
Amanda Clare, Ross D. King
PADL1
2002 Machine learning of functional class from phenotype data
abstract
MOTIVATION: Mutant phenotype growth experiments are an important novel source of functional genomics data which have received little attention in bioinformatics. We applied supervised machine learning to the problem of using phenotype data to predict the functional class of Open Reading Frames (ORFs) in Saccaromyces cerevisiae. Three sources of data were used: TRansposon-Insertion Phenotypes, Localization and Expression in Saccharomyces (TRIPLES), European Functional Analysis Network (EUROFAN) and Munich Information Center for Protein Sequences (MIPS). The analysis of the data presented a number of challenges to machine learning: multi-class labels, a large number of sparsely populated classes, the need to learn a set of accurate rules (not a complete classification), and a very large amount of missing values. We modified the algorithm C4.5 to deal with these problems. RESULTS: Rules were learnt which are accurate and biologically meaningful. The rules predict function of 83 ORFs of unknown function at an estimated accuracy of > or = 80%.
Amanda Clare, Ross D. King
Bioinform.1
2001 Knowledge Discovery in Multi-label Phenotype Data
Amanda Clare, Ross D. King
PKDD1
2001 The utility of different representations of protein sequence for predicting functional class
abstract
Abstract Motivation: Data Mining Prediction (DMP) is a novel approach to predicting protein functional class from sequence. DMP works even in the absence of a homologous protein of known function. We investigate the utility of different ways of representing protein sequence in DMP (residue frequencies, phylogeny, predicted structure) using the Escherichia coli genome as a model. Results: Using the different representations DMP learnt prediction rules that were more accurate than default at every level of function using every type of representation. The most effective way to represent sequence was using phylogeny (75% accuracy and 13% coverage of unassigned ORFs at the most general level of function: 69% accuracy and 7% coverage at the most detailed). We tested different methods for combining predictions from the different types of representation. These improved both the accuracy and coverage of predictions, e.g. 40% of all unassigned ORFs could be predicted at an estimated accuracy of 60% and 5% of unassigned ORFs could be predicted at an estimated accuracy of 86%. Availability: The rules and data are freely available. Warmr is free to academics. Contact: [email protected] Supplementary information: http://www.aber.ac.uk/~dcswww/Research/bio/ProteinFunction * To whom correspondence should be addressed.
Ross D. King, Andreas Karwath, Amanda Clare, Luc Dehaspe
Bioinform.3
2001 A natural language system for retrieval of captioned images
abstract
ANVIL is an information retrieval system using natural language processing techniques, intended for retrieval of captioned images. It extracts dependency structures from the image captions and user queries, and then applies a high accuracy matching algorithm which recursively explores the dependency structures to determine their similarity. A further algorithm allows additional contextual information to be extracted following a successful match, with the intention of helping users understand and organise the retrieval results. ANVIL was developed to high engineering standards, and as well as looking at the research aspects of the system, we also look at some of the design and development issues. English and Japanese versions of the system have been developed.
David Elworthy, Tony Rose, Amanda Clare, Aaron C. W. Kotcheff
Nat. Lang. Eng.3
2000 Genome scale prediction of protein functional class from sequence using data mining
abstract
The ability to predict protein function from amino acid sequence is a central research goal of molecular biology.Such a capability would greatly aid the biological interpretation of the genomic data and accelerate its medical exploitation.For the existing sequenced genomes function can be assigned to typically only between 40-60% of the genes [4,8,12,7].The new science of functional genomics is dedicated to discovering the function of these genes, and to further detailing gene function [10,27,17,6].Here we present a novel data-mining [24,18] approach to predicting protein functional class from sequence.We demonstrate the effectiveness of this approach on the Mycobacterium tuberculosis [8] genome.Biologically interpretable rules are identified that can predict protein function even in the absence of identifiable sequence homology.These rules predict 65% of the genes with no previous assigned function in Mycobacterium tuberculosis (the bacteria which causes TB) with an estimated accuracy of 60-80% (depending on the level of functional assignment).The rules give insight into the evolutionary history of the organism.
Ross D. King, Andreas Karwath, Amanda Clare, Luc Dehaspe
KDD3