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

Michael I. Sadowski

dblp:99/4032 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2012
0000-0002-4546-2159ORCID · verified

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

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

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › protein structure analysis
protein structure alignment
0.112012
Evolutionary inaccuracy of pairwise structural alignments · Bioinform. 2012
Bioinformatics and computational biology › protein structure prediction › template-based modeling
fold recognition
0.112009
pGenTHREADER and pDomTHREADER: new methods for improved protein fold recognition and superfamily discrimination · Bioinform. 2009
Bioinformatics and computational biology
protein structure prediction
0.112009
pGenTHREADER and pDomTHREADER: new methods for improved protein fold recognition and superfamily discrimination · Bioinform. 2009
Bioinformatics and computational biology › sequence analysis › homology detection
remote homology detection
0.112009
pGenTHREADER and pDomTHREADER: new methods for improved protein fold recognition and superfamily discrimination · Bioinform. 2009
Bioinformatics and computational biology
protein structure analysis
0.012012
Evolutionary inaccuracy of pairwise structural alignments · Bioinform. 2012
Bioinformatics and computational biology
g-protein coupled receptor
0.012003
Automated generation and refinement of protein signatures: case study with G-protein coupled receptors · Bioinform. 2003
Bioinformatics and computational biology › protein function prediction › protein classification
protein family classification
0.012003
Automated generation and refinement of protein signatures: case study with G-protein coupled receptors · Bioinform. 2003

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

structural alignment · 0.1geometric measures · 0.1support vector machine · 0.1solvation potential · 0.1secondary-structure gap penalties · 0.1profile-profile alignment · 0.1secondary structure prediction · 0.0hidden markov model · 0.0genetic algorithm · 0.0
YearPublicationVenuePosition
2012 Evolutionary inaccuracy of pairwise structural alignments
abstract
MOTIVATION: Structural alignment methods are widely used to generate gold standard alignments for improving multiple sequence alignments and transferring functional annotations, as well as for assigning structural distances between proteins. However, the correctness of the alignments generated by these methods is difficult to assess objectively since little is known about the exact evolutionary history of most proteins. Since homology is an equivalence relation, an upper bound on alignment quality can be found by assessing the consistency of alignments. Measuring the consistency of current methods of structure alignment and determining the causes of inconsistencies can, therefore, provide information on the quality of current methods and suggest possibilities for further improvement. RESULTS: We analyze the self-consistency of seven widely-used structural alignment methods (SAP, TM-align, Fr-TM-align, MAMMOTH, DALI, CE and FATCAT) on a diverse, non-redundant set of 1863 domains from the SCOP database and demonstrate that even for relatively similar proteins the degree of inconsistency of the alignments on a residue level is high (30%). We further show that levels of consistency vary substantially between methods, with two methods (SAP and Fr-TM-align) producing more consistent alignments than the rest. Inconsistency is found to be higher near gaps and for proteins of low structural complexity, as well as for helices. The ability of the methods to identify good structural alignments is also assessed using geometric measures, for which FATCAT (flexible mode) is found to be the best performer despite being highly inconsistent. We conclude that there is substantial scope for improving the consistency of structural alignment methods. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Michael I. Sadowski, William R. Taylor
Bioinform.1
2009 pGenTHREADER and pDomTHREADER: new methods for improved protein fold recognition and superfamily discrimination
abstract
MOTIVATION: Generation of structural models and recognition of homologous relationships for unannotated protein sequences are fundamental problems in bioinformatics. Improving the sensitivity and selectivity of methods designed for these two tasks therefore has downstream benefits for many other bioinformatics applications. RESULTS: We describe the latest implementation of the GenTHREADER method for structure prediction on a genomic scale. The method combines profile-profile alignments with secondary-structure specific gap-penalties, classic pair- and solvation potentials using a linear combination optimized with a regression SVM model. We find this combination significantly improves both detection of useful templates and accuracy of sequence-structure alignments relative to other competitive approaches. We further present a second implementation of the protocol designed for the task of discriminating superfamilies from one another. This method, pDomTHREADER, is the first to incorporate both sequence and structural data directly in this task and improves sensitivity and selectivity over the standard version of pGenTHREADER and three other standard methods for remote homology detection.
Anna E. Lobley, Michael I. Sadowski, David T. Jones
Bioinform.2
2003 Automated generation and refinement of protein signatures: case study with G-protein coupled receptors
abstract
Abstract Motivation: Previous work had established that it was possible to derive sparse signatures (essentially sequence-length motifs) by examining points of contact between residues in proteins of known three-dimensional (3D) structure. Many interesting protein families have very little tertiary structural information. Methods for deriving signatures using only primary and secondary-structural information were therefore developed. Results: Two methods for deriving protein signatures using protein sequence information and predicted secondary structures are described. One method is based on a scoring approach, the other on the Genetic Algorithm (GA). The effectiveness of the method was tested on the superfamily of GPCRs and compared with the established hidden Markov model (HMM) method. The signature method is shown to perform well, detecting 68% of superfamily members before the first false positive sequence and detecting several distant relationships. The GA population was used to provide information on alignment regions of particular importance for selection of key residues. Contact: [email protected] Supplementary information: Software developed for this project and further data are available online (http://bbsrc-bioinf.leeds.ac.uk/BIOINF/jhp/) * To whom correspondence should be addressed.
Michael I. Sadowski, John Howard Parish
Bioinform.1