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

David M. A. Martin

dblp:06/5469 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2010
0000-0002-8732-204XORCID · reported

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

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

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › proteomics
phosphoproteomics
0.112010
Prophossi: automating expert validation of phosphopeptide-spectrum matches from tandem mass spectrometry · Bioinform. 2010
Bioinformatics and computational biology
proteomics
0.112010
Prophossi: automating expert validation of phosphopeptide-spectrum matches from tandem mass spectrometry · Bioinform. 2010
Bioinformatics and computational biology › multiple sequence alignment
alignment editing
0.112009
Jalview Version 2 - a multiple sequence alignment editor and analysis workbench · Bioinform. 2009
Bioinformatics and computational biology › multiple sequence alignment
alignment visualization
0.112009
Jalview Version 2 - a multiple sequence alignment editor and analysis workbench · Bioinform. 2009
Bioinformatics and computational biology
biological data visualization
0.112009
Jalview Version 2 - a multiple sequence alignment editor and analysis workbench · Bioinform. 2009
Bioinformatics and computational biology
multiple sequence alignment
0.112009
Jalview Version 2 - a multiple sequence alignment editor and analysis workbench · Bioinform. 2009
Bioinformatics and computational biology
sequence analysis
0.112009
Jalview Version 2 - a multiple sequence alignment editor and analysis workbench · Bioinform. 2009
Bioinformatics and computational biology › genome annotation
annotation quality assessment
0.012003
Evaluation of annotation strategies using an entire genome sequence · Bioinform. 2003
Bioinformatics and computational biology › genome annotation
functional annotation
0.012003
Evaluation of annotation strategies using an entire genome sequence · Bioinform. 2003
Bioinformatics and computational biology
genome annotation
0.012003
Evaluation of annotation strategies using an entire genome sequence · Bioinform. 2003
Bioinformatics and computational biology › sequence analysis › sequence similarity search
sequence database search
0.012003
Visual Representation of Database Search Results: The RHIMS Plot · Bioinform. 2003
Bioinformatics and computational biology › proteomics
tandem mass spectrometry
0.012010
Prophossi: automating expert validation of phosphopeptide-spectrum matches from tandem mass spectrometry · Bioinform. 2010
Bioinformatics and computational biology › data integration
biological data integration
0.012009
Jalview Version 2 - a multiple sequence alignment editor and analysis workbench · Bioinform. 2009
Bioinformatics and computational biology
web services
0.012009
Jalview Version 2 - a multiple sequence alignment editor and analysis workbench · Bioinform. 2009
Bioinformatics and computational biology › genome annotation
automatic annotation
0.012003
Evaluation of annotation strategies using an entire genome sequence · Bioinform. 2003

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

rule-based validation · 0.1knowledge base · 0.1jmol · 0.1text mining · 0.0comparative analysis · 0.0
YearPublicationVenuePosition
2010 Prophossi: automating expert validation of phosphopeptide-spectrum matches from tandem mass spectrometry
abstract
MOTIVATION: Complex patterns of protein phosphorylation mediate many cellular processes. Tandem mass spectrometry (MS/MS) is a powerful tool for identifying these post-translational modifications. In high-throughput experiments, mass spectrometry database search engines, such as MASCOT provide a ranked list of peptide identifications based on hundreds of thousands of MS/MS spectra obtained in a mass spectrometry experiment. These search results are not in themselves sufficient for confident assignment of phosphorylation sites as identification of characteristic mass differences requires time-consuming manual assessment of the spectra by an experienced analyst. The time required for manual assessment has previously rendered high-throughput confident assignment of phosphorylation sites challenging. RESULTS: We have developed a knowledge base of criteria, which replicate expert assessment, allowing more than half of cases to be automatically validated and site assignments verified with a high degree of confidence. This was assessed by comparing automated spectral interpretation with careful manual examination of the assignments for 501 peptides above the 1% false discovery rate (FDR) threshold corresponding to 259 putative phosphorylation sites in 74 proteins of the Trypanosoma brucei proteome. Despite this stringent approach, we are able to validate 80 of the 91 phosphorylation sites (88%) positively identified by manual examination of the spectra used for the MASCOT searches with a FDR < 15%. CONCLUSIONS: High-throughput computational analysis can provide a viable second stage validation of primary mass spectrometry database search results. Such validation gives rapid access to a systems level overview of protein phosphorylation in the experiment under investigation. AVAILABILITY: A GPL licensed software implementation in Perl for analysis and spectrum annotation is available in the supplementary material and a web server can be assessed online at http://www.compbio.dundee.ac.uk/prophossi.
David M. A. Martin, Isabelle R. E. Nett, Franck Vandermoere, Jonathan D. Barber, Nicholas A. Morrice, Michael A. J. Ferguson
Bioinform.1
2009 Jalview Version 2 - a multiple sequence alignment editor and analysis workbench
abstract
UNLABELLED: Jalview Version 2 is a system for interactive WYSIWYG editing, analysis and annotation of multiple sequence alignments. Core features include keyboard and mouse-based editing, multiple views and alignment overviews, and linked structure display with Jmol. Jalview 2 is available in two forms: a lightweight Java applet for use in web applications, and a powerful desktop application that employs web services for sequence alignment, secondary structure prediction and the retrieval of alignments, sequences, annotation and structures from public databases and any DAS 1.53 compliant sequence or annotation server. AVAILABILITY: The Jalview 2 Desktop application and JalviewLite applet are made freely available under the GPL, and can be downloaded from www.jalview.org.
Andrew M. Waterhouse, James B. Procter, David M. A. Martin, Michele E. Clamp, Geoffrey J. Barton
Bioinform.3
2005 Jalview: Visualization and Analysis of Molecular Sequences, Alignments, and Structures
Andrew M. Waterhouse, James B. Procter, David M. A. Martin, Geoffrey J. Barton
BMC Bioinform.3
2004 GOtcha: a new method for prediction of protein function assessed by the annotation of seven genomes
abstract
BACKGROUND: The function of a novel gene product is typically predicted by transitive assignment of annotation from similar sequences. We describe a novel method, GOtcha, for predicting gene product function by annotation with Gene Ontology (GO) terms. GOtcha predicts GO term associations with term-specific probability (P-score) measures of confidence. Term-specific probabilities are a novel feature of GOtcha and allow the identification of conflicts or uncertainty in annotation. RESULTS: The GOtcha method was applied to the recently sequenced genome for Plasmodium falciparum and six other genomes. GOtcha was compared quantitatively for retrieval of assigned GO terms against direct transitive assignment from the highest scoring annotated BLAST search hit (TOPBLAST). GOtcha exploits information deep into the 'twilight zone' of similarity search matches, making use of much information that is otherwise discarded by more simplistic approaches. At a P-score cutoff of 50%, GOtcha provided 60% better recovery of annotation terms and 20% higher selectivity than annotation with TOPBLAST at an E-value cutoff of 10(-4). CONCLUSIONS: The GOtcha method is a useful tool for genome annotators. It has identified both errors and omissions in the original Plasmodium falciparum annotation and is being adopted by many other genome sequencing projects.
David M. A. Martin, Matthew Berriman, Geoffrey J. Barton
BMC Bioinform.1
2003 Evaluation of annotation strategies using an entire genome sequence
abstract
Abstract Motivation: Genome-wide functional annotation either by manual or automatic means has raised considerable concerns regarding the accuracy of assignments and the reproducibility of methodologies. In addition, a performance evaluation of automated systems that attempt to tackle sequence analyses rapidly and reproducibly is generally missing. In order to quantify the accuracy and reproducibility of function assignments on a genome-wide scale, we have re-annotated the entire genome sequence of Chlamydia trachomatis (serovar D), in a collaborative manner. Results: We have encoded all annotations in a structured format to allow further comparison and data exchange and have used a scale that records the different levels of potential annotation errors according to their propensity to propagate in the database due to transitive function assignments. We conclude that genome annotation may entail a considerable amount of errors, ranging from simple typographical errors to complex sequence analysis problems. The most surprising result of this comparative study is that automatic systems might perform as well as the teams of experts annotating genome sequences. Availability and supplementary information: http://www.ebi.ac.uk/research/cgg/annotation/cteval/ Contact: [email protected] * To whom correspondence should be addressed. † INA-EKETA, GR-57001 Thessaloniki, Greece ‡ Computational Biology Center, Memorial Sloan-Kettering Cancer Center, New York, NY 10021, USA § Aetion Technologies LLC, Worthington, OH 43085, USA ¶ Institut Curie, F-75248 Paris, France ∥ CNRS, UMR6543, F-06108 Nice, France ** Alma Bioinformatics, E-28760 Madrid, Spain †† Cap Gemini Ernst & Young, London SW1X 7LX, UK ‡‡ Univ. of Rome ‘La Sapienza’, I-00185 Rome, Italy §§ MWG-Biotech AG, Ebersberg, D-85560 Berlin, Germany ¶¶ Wellcome Trust Biocentre, Univ. of Dundee, Dundee DD1 5HN, UK
Sophia Tsoka, Miguel A. Andrade-Navarro, Anton J. Enright, Mark Carroll, Patrick Poullet, Vasilis J. Promponas, Theodore Liakopoulos, Giorgos Palaios, Claude Pasquier, Stavros J. Hamodrakas, Javier Tamames, Asutosh T. Yagnik, Anna Tramontano, Damien Devos, Christian Blaschke, Alfonso Valencia, David Brett, David M. A. Martin, Christophe Leroy, Isidore Rigoutsos, Chris Sander, Christos A. Ouzounis
Bioinform.19
2003 Visual Representation of Database Search Results: The RHIMS Plot
abstract
SUMMARY: An algorithm and software are described that provide a fast method to produce a novel, function-oriented visualization of the results of a sequence database search. Text mining of sequence annotations allows position specific plots of potential functional similarity to be compared in a simple compact representation. AVAILABILITY: The application can be accessed via a web server at http://www.compbio.dundee.ac.uk. The RHIMS software may be obtained by request to the authors.
David M. A. Martin, Pamela Hill, Geoffrey J. Barton, Andrew J. Flavell
Bioinform.1