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.
? Tutorial for this page

Jonathan G. L. Mullins

dblp:19/4836 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2001
0000-0003-0144-2962ORCID · reported

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

Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 1

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
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
protein structure analysis
0.012001
TMCompare: transmembrane region sequence and structure · Bioinform. 2001
Bioinformatics and computational biology › structural bioinformatics
sequence-structure alignment
0.012001
TMCompare: transmembrane region sequence and structure · Bioinform. 2001
YearPublicationVenuePosition
2001 Finding and Characterising Candidate Binding Sites
abstract
We present a method for identifying and representing indentations, cavities and holes in a known protein structure. The identification procedure is performed initially. Once a pocket in the protein has been found, we use a boundary representation technique to represent it. Both the identification and the representation procedures rely upon modifications to the Marching Cubes algorithm of Lorensen and Cline (1987), which can be used to give a piecewise planar representation of a three-dimensional object. The identification of a pocket essentially involves finding a point, (x/sub 0/, y/sub 0/, z/sub 0/) say. The point should be such that a sphere of radius r can he centred there, without touching the centre of any atom in the protein, but there exists R>r such that a sphere of radius R centred at (x/sub 0/, y/sub 0/, z/sub 0/) does touch the centre of an atom. If such a point is found, then it is deemed to be in a pocket. The boundary representation technique involves storing information about a boundary in the structure of a graph. The graph structure of a pocket, potential docking site, can then be compared to the graph structure of a candidate binding substrate using standard graph comparison algorithms. The required input for the algorithm is in the form of a Protein Data Bank (PDB) file.
Gareth Hannaford, Carsten Maple, Jonathan G. L. Mullins
IV3
2001 TMCompare: transmembrane region sequence and structure
abstract
UNLABELLED: TMCompare is an alignment and visualization tool for comparison of sequence information for membrane proteins contained in SWISS-PROT entries, with structural information contained in PDB files. The program can be used for: detection of breaks in alpha helical structure of transmembrane regions; examination of differences in coverage between PDB and SWISS-PROT files; examination of annotation differences between PDB files and associated SWISS-PROT files; examination and comparison of assigned PDB alpha helix regions and assigned SWISS-PROT transmembrane regions in linear sequence (one letter code) format; examination of these differences in 3D using the CHIME plugin, allowing; analysis of the alpha and non-alpha content of transmembrane regions. AVAILABILITY: TMCompare is available for use through selection of a query protein via the internet (http://www.membraneproteins.org/TMCompare) CONTACT: [email protected]
Roberto C. Togawa, John F. Antoniw, Jonathan G. L. Mullins
Bioinform.3