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

Matthew N. Davies

dblp:53/6116 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2008
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 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
2 papers
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › protein function prediction › protein classification
GPCR classification
0.222008
Optimizing amino acid groupings for GPCR classification · Bioinform. 2008
On the hierarchical classification of G protein-coupled receptors · Bioinform. 2007
Bioinformatics and computational biology › protein function prediction
protein classification
0.222008
Optimizing amino acid groupings for GPCR classification · Bioinform. 2008
On the hierarchical classification of G protein-coupled receptors · Bioinform. 2007
Bioinformatics and computational biology › sequence analysis › sequence comparison
alignment-free sequence analysis
0.012008
Optimizing amino acid groupings for GPCR classification · Bioinform. 2008
Bioinformatics and computational biology › molecular informatics › cheminformatics
proteochemometrics
0.012007
On the hierarchical classification of G protein-coupled receptors · Bioinform. 2007

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

optimization · 0.1artificial immune system · 0.1support vector machine · 0.1data mining · 0.1
YearPublicationVenuePosition
2008 Optimizing amino acid groupings for GPCR classification
abstract
MOTIVATION: There is much interest in reducing the complexity inherent in the representation of the 20 standard amino acids within bioinformatics algorithms by developing a so-called reduced alphabet. Although there is no universally applicable residue grouping, there are numerous physiochemical criteria upon which one can base groupings. Local descriptors are a form of alignment-free analysis, the efficiency of which is dependent upon the correct selection of amino acid groupings. RESULTS: Within the context of G-protein coupled receptor (GPCR) classification, an optimization algorithm was developed, which was able to identify the most efficient grouping when used to generate local descriptors. The algorithm was inspired by the relatively new computational intelligence paradigm of artificial immune systems. A number of amino acid groupings produced by this algorithm were evaluated with respect to their ability to generate local descriptors capable of providing an accurate classification algorithm for GPCRs.
Matthew N. Davies, Andrew Secker, Alex Alves Freitas, Edward Clark, Jonathan Timmis, Darren R. Flower
Bioinform.1
2007 On the hierarchical classification of G protein-coupled receptors
abstract
MOTIVATION: G protein-coupled receptors (GPCRs) play an important role in many physiological systems by transducing an extracellular signal into an intracellular response. Over 50% of all marketed drugs are targeted towards a GPCR. There is considerable interest in developing an algorithm that could effectively predict the function of a GPCR from its primary sequence. Such an algorithm is useful not only in identifying novel GPCR sequences but in characterizing the interrelationships between known GPCRs. RESULTS: An alignment-free approach to GPCR classification has been developed using techniques drawn from data mining and proteochemometrics. A dataset of over 8000 sequences was constructed to train the algorithm. This represents one of the largest GPCR datasets currently available. A predictive algorithm was developed based upon the simplest reasonable numerical representation of the protein's physicochemical properties. A selective top-down approach was developed, which used a hierarchical classifier to assign sequences to subdivisions within the GPCR hierarchy. The predictive performance of the algorithm was assessed against several standard data mining classifiers and further validated against Support Vector Machine-based GPCR prediction servers. The selective top-down approach achieves significantly higher accuracy than standard data mining methods in almost all cases.
Matthew N. Davies, Andrew Secker, Alex Alves Freitas, Miguel Mendao, Jonathan Timmis, Darren R. Flower
Bioinform.1