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

Christophe Leroy

dblp:92/6936 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 4

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 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
genome annotation
0.122003
Evaluation of annotation strategies using an entire genome sequence · Bioinform. 2003
Automated genome sequence analysis and annotation · Bioinform. 1999
Bioinformatics and computational biology
sequence analysis
0.022000
CAST: an iterative algorithm for the complexity analysis of sequence tracts · Bioinform. 2000
MView: a web-compatible database search or multiple alignment viewer · Bioinform. 1998
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
automatic annotation
0.022003
Automated genome sequence analysis and annotation · Bioinform. 1999
Evaluation of annotation strategies using an entire genome sequence · Bioinform. 2003
Bioinformatics and computational biology › protein sequence analysis › protein sequence annotation
low complexity region analysis
0.012000
CAST: an iterative algorithm for the complexity analysis of sequence tracts · Bioinform. 2000
Bioinformatics and computational biology
protein function prediction
0.011999
Automated genome sequence analysis and annotation · Bioinform. 1999
Bioinformatics and computational biology › multiple sequence alignment
multiple sequence alignment visualization
0.011998
MView: a web-compatible database search or multiple alignment viewer · Bioinform. 1998
Bioinformatics and computational biology › sequence analysis › sequence similarity search
sequence database search
0.011999
Automated genome sequence analysis and annotation · Bioinform. 1999

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

comparative analysis · 0.0smith-waterman alignment · 0.0sequence analysis · 0.0lexical analysis · 0.0HTML rendering · 0.0
YearPublicationVenuePosition
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.20
2000 CAST: an iterative algorithm for the complexity analysis of sequence tracts
abstract
MOTIVATION: Sensitive detection and masking of low-complexity regions in protein sequences. Filtered sequences can be used in sequence comparison without the risk of matching compositionally biased regions. The main advantage of the method over similar approaches is the selective masking of single residue types without affecting other, possibly important, regions. RESULTS: A novel algorithm for low-complexity region detection and selective masking. The algorithm is based on multiple-pass Smith-Waterman comparison of the query sequence against twenty homopolymers with infinite gap penalties. The output of the algorithm is both the masked query sequence for further analysis, e.g. database searches, as well as the regions of low complexity. The detection of low-complexity regions is highly specific for single residue types. It is shown that this approach is sufficient for masking database query sequences without generating false positives. The algorithm is benchmarked against widely available algorithms using the 210 genes of Plasmodium falciparum chromosome 2, a dataset known to contain a large number of low-complexity regions. AVAILABILITY: CAST (version 1.0) executable binaries are available to academic users free of charge under license. Web site entry point, server and additional material: http://www.ebi.ac.uk/research/cgg/services/cast/
Vasilis J. Promponas, Anton J. Enright, Sophia Tsoka, David P. Kreil, Christophe Leroy, Stavros J. Hamodrakas, Chris Sander, Christos A. Ouzounis
Bioinform.5
1999 Automated genome sequence analysis and annotation
abstract
MOTIVATION: Large-scale genome projects generate a rapidly increasing number of sequences, most of them biochemically uncharacterized. Research in bioinformatics contributes to the development of methods for the computational characterization of these sequences. However, the installation and application of these methods require experience and are time consuming. RESULTS: We present here an automatic system for preliminary functional annotation of protein sequences that has been applied to the analysis of sets of sequences from complete genomes, both to refine overall performance and to make new discoveries comparable to those made by human experts. The GeneQuiz system includes a Web-based browser that allows examination of the evidence leading to an automatic annotation and offers additional information, views of the results, and links to biological databases that complement the automatic analysis. System structure and operating principles concerning the use of multiple sequence databases, underlying sequence analysis tools, lexical analyses of database annotations and decision criteria for functional assignments are detailed. The system makes automatic quality assessments of results based on prior experience with the underlying sequence analysis tools; overall error rates in functional assignment are estimated at 2.5-5% for cases annotated with highest reliability ('clear' cases). Sources of over-interpretation of results are discussed with proposals for improvement. A conservative definition for reporting 'new findings' that takes account of database maturity is presented along with examples of possible kinds of discoveries (new function, family and superfamily) made by the system. System performance in relation to sequence database coverage, database dynamics and database search methods is analysed, demonstrating the inherent advantages of an integrated automatic approach using multiple databases and search methods applied in an objective and repeatable manner. AVAILABILITY: The GeneQuiz system is publicly available for analysis of protein sequences through a Web server at http://www.sander.ebi.ac. uk/gqsrv/submit
Miguel A. Andrade-Navarro, Nigel P. Brown, Christophe Leroy, S. Hörsch, Antoine de Daruvar, C. Reich, Angelo Franchini, Javier Tamames, Alfonso Valencia, Christos A. Ouzounis, Chris Sander
Bioinform.3
1998 MView: a web-compatible database search or multiple alignment viewer
abstract
UNLABELLED: MView is a tool for converting the results of a sequence database search into the form of a coloured multiple alignment of hits stacked against the query. Alternatively, an existing multiple alignment can be processed. In either case, the output is simply HTML, so the result is platform independent and does not require a separate application or applet to be loaded. AVAILABILITY: Free from http://www.sander.ebi.ac.uk/mview/ subject to copyright restrictions. CONTACT: [email protected]
Nigel P. Brown, Christophe Leroy, Chris Sander
Bioinform.2