EGEleanor J. Gardiner

Eleanor J. Gardiner

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Eleanor J. Gardiner has a total of 14 co-authors. Here are the top co-authors by number of shared publications:

  • Peter Willett

    Department of Information Studies, University of Sheffield, 211 Portobello St., Regent Court, Sheffield, United Kingdom, and AstraZeneca, Mereside, Alderley Park, Macclesfield, Cheshire, United Kingdom

    6 shared publications
  • Christopher A. Hunter

    Centre for Chemical Biology, Krebs Institute for Biomolecular Science, Department of Chemistry, University of Sheffield, Sheffield S3 7HF, United Kingdom, and Department of Information Studies, University of Sheffield, Sheffield S1 4DP, United Kingdom

    2 shared publications
  • David A. Cosgrove

    Department of Information Studies, University of Sheffield, Regent Court, 211 Portobello Street, Sheffield S1 4DP, United Kingdom, AstraZeneca, Mereside, Alderley Park, Macclesfield, Cheshire, United Kingdom SK10 4TG, and Cambridge Crystallographic Data Centre, 12 Union Road, Cambridge, CB2 1EZ, United Kingdom

    2 shared publications
  • Peter J. Artymiuk

    Department of Molecular Biology and Biotechnology, Krebs Institute, Sheffield University, Sheffield, United Kingdom

    2 shared publications
  • Peter Willett

    Information School, University of Sheffield, 211 Portobello, Sheffield, S1 4DP, UK

    2 shared publications
  • Valerie J. Gillet

    Information School, University of Sheffield, The Wave, 2 Whitham Road, Sheffield S10 2AH, U.K.

    2 shared publications

Latest Publications

  • Multiobjective Optimization of Pharmacophore Hypotheses: Bias Toward Low-Energy Conformations

    by Eleanor J. Gardiner, David A. Cosgrove, Robin Taylor, Valerie J. Gillet

    Two methods are described for biasing conformational search during pharmacophore elucidation using a multiobjective genetic algorithm (MOGA). The MOGA explores conformation on-the-fly while simultaneously aligning a set of molecules such that their pharmacophoric features are maximally overlaid. By using a clique detection method to generate overlays of precomputed conformations to initialize the population (rather than starting from random), the speed of the algorithm has been increased by 2 orders of magnitude. This increase in speed has enabled the program to be applied to greater numbers of molecules than was previously possible. Furthermore, it was found that biasing the conformations explored during search time to those found in the Cambridge Structural Database could also improve the quality of the results.


  • Open Access

    Structural Fingerprints of Transcription Factor Binding Site Regions

    by Eleanor J. J. Gardiner, Christopher A. Hunter, Peter Willett

    Fourier transforms are a powerful tool in the prediction of DNA sequence properties, such as the presence/absence of codons. We have previously compiled a database of the structural properties of all 32,896 unique DNA octamers. In this work we apply Fourier techniques to the analysis of the structural properties of human chromosomes 21 and 22 and also to three sets of transcription factor binding sites within these chromosomes. We find that, for a given structural property, the structural property power spectra of chromosomes 21 and 22 are strikingly similar. We find common peaks in their power spectra for both Sp1 and p53 transcription factor binding sites. We use the power spectra as a structural fingerprint and perform similarity searching in order to find transcription factor binding site regions. This approach provides a new strategy for searching the genome data for information. Although it is difficult to understand the relationship between specific functional properties and the set of structural parameters in our database, our structural fingerprints nevertheless provide a useful tool for searching for function information in sequence data. The power spectrum fingerprints provide a simple, fast method for comparing a set of functional sequences, in this case transcription factor binding site regions, with the sequences of whole chromosomes. On its own, the power spectrum fingerprint does not find all transcription factor binding sites in a chromosome, but the results presented here show that in combination with other approaches, this technique will improve the chances of identifying functional sequences hidden in genomic data.


  • Representing Clusters Using a Maximum Common Edge Substructure Algorithm Applied to Reduced Graphs and Molecular Graphs

    by Eleanor J. Gardiner, Valerie J. Gillet, Peter Willett, David A. Cosgrove

    Chemical databases are routinely clustered, with the aim of grouping molecules which share similar structural features. Ideally, medicinal chemists are then able to browse a few representatives of the cluster in order to interpret the shared activity of the cluster members. However, when molecules are clustered using fingerprints, it may be difficult to decipher the structural commonalities which are present. Here, we seek to represent a cluster by means of a maximum common substructure based on the shared functionality of the cluster members. Previously, we have used reduced graphs, where each node corresponds to a generalized functional group, as topological molecular descriptors for virtual screening. In this work, we precluster a database using any clustering method. We then represent the molecules in a cluster as reduced graphs. By repeated application of a maximum common edge substructure (MCES) algorithm, we obtain one or more reduced graph cluster representatives. The sparsity of the reduced graphs means that the MCES calculations can be performed in real time. The reduced graph cluster representatives are readily interpretable in terms of functional activity and can be mapped directly back to the molecules to which they correspond, giving the chemist a rapid means of assessing potential activities contained within the cluster. Clusters of interest are then subject to a detailed R-group analysis using the same iterated MCES algorithm applied to the molecular graphs.


  • Genomic Data Analysis Using DNA Structure: An Analysis of Conserved Nongenic Sequences and Ultraconserved Elements

    by Eleanor J. Gardiner, Linda Hirons, Christopher A. Hunter, Peter Willett

    Recent comparative studies of the human and mouse genomes have revealed sets of conserved nongenic sequences (CNGs) and sets of ultraconserved elements (UCEs). Both sets of sequences, which exhibit extremely high levels of conservation, extend over hundreds of bases and have no known function. Since there is no detectable sequence homology between paralogous CNGs or UCEs in either of the species, an alignment-free technique is needed for their analysis. We have previously compiled a database of the structural properties of all 32 896 unique DNA octamers, including information on stability, the minimum energy conformation, and flexibility. We have used Fourier techniques to analyze the UCEs and CNGs in terms of their octamer structural properties, to reveal structural correlations which may indicate possible functions for some of these sequences.


  • A Structural Similarity Analysis of Double-helical DNA

    by Eleanor J. Gardiner, Christopher A. Hunter, Xiang-Jun Lu, Peter Willett


  • Sequence-dependent DNA Structure: A Database of Octamer Structural Parameters

    by Eleanor J Gardiner, Christopher A Hunter, Martin J Packer, David S Palmer, Peter Willett


  • Protein docking using a genetic algorithm

    by Eleanor J. Gardiner, Peter Willett, Peter J. Artymiuk

    A genetic algorithm (GA) for protein–protein docking is described, in which the proteins are represented by dot surfaces calculated using the Connolly program. The GA is used to move the surface of one protein relative to the other to locate the area of greatest surface complementarity between the two. Surface dots are deemed complementary if their normals are opposed, their Connolly shape type is complementary, and their hydrogen bonding or hydrophobic potential is fulfilled. Overlap of the protein interiors is penalized. The GA is tested on 34 large protein–protein complexes where one or both proteins has been crystallized separately. Parameters are established for which 30 of the complexes have at least one near‐native solution ranked in the top 100. We have also successfully reassembled a 1,400‐residue heptamer based on the top‐ranking GA solution obtained when docking two bound subunits. Proteins 2001;44:44–56.


  • Graph-Theoretic Techniques for Macromolecular Docking

    by Eleanor J. Gardiner, Peter Willett, Peter J. Artymiuk

    We propose a solution to the problem of docking two macromolecules. We represent each of two proteins as a set of potential hydrogen bond donors and acceptors and use a clique-detection algorithm to find maximally complementary sets of donor/acceptor pairs. Preliminary results are presented which demonstrate the feasibility of the method.