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.

Benjamin Bardiaux

dblp:43/3016 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0003-4014-9195ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 3Theory of computation · 2

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 › structural biology
NMR structure calculation
0.112007
ARIA2: Automated NOE assignment and data integration in NMR structure calculation · Bioinform. 2007
Bioinformatics and computational biology
structural biology
0.112007
ARIA2: Automated NOE assignment and data integration in NMR structure calculation · Bioinform. 2007
Bioinformatics and computational biology › protein analysis › protein bioinformatics
protein annotation
0.012004
Data mining techniques to study the disulfide-bonding state in proteins: signal peptide is a strong descriptor · Bioinform. 2004
Bioinformatics and computational biology
protein structure prediction
0.012004
Data mining techniques to study the disulfide-bonding state in proteins: signal peptide is a strong descriptor · Bioinform. 2004

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

ambiguous restraints iterative assignment · 0.1CCPN data model · 0.1association rule mining · 0.0
YearPublicationVenuePosition
2019 Minimal NMR distance information for rigidity of protein graphs
abstract
Nuclear Magnetic Resonance (NMR) experiments provide distances between nearby atoms of a protein molecule. The corresponding structure determination problem is to determine the 3D protein structure by exploiting such distances. We present a new order on the atoms of the protein, based on information from the chemistry of proteins and NMR experiments, which allows us to formulate the problem as a combinatorial search. Additionally, this order tells us what kind of NMR distance information is crucial to understand the cardinality of the solution set of the problem and its computational complexity.
Carlile Lavor, Leo Liberti, Bruce Randall Donald, Bradley Worley, Benjamin Bardiaux, Therese E. Malliavin, Michael Nilges
Discret. Appl. Math.5
2018 Tuning interval Branch-and-Prune for protein structure determination
Bradley Worley, Florent Delhommel, Florence Cordier, Therese E. Malliavin, Benjamin Bardiaux, Nicolas Wolff, Michael Nilges, Carlile Lavor, Leo Liberti
J. Glob. Optim.5
2015 An algorithm to enumerate all possible protein conformations verifying a set of distance constraints
abstract
BACKGROUND: The determination of protein structures satisfying distance constraints is an important problem in structural biology. Whereas the most common method currently employed is simulated annealing, there have been other methods previously proposed in the literature. Most of them, however, are designed to find one solution only. RESULTS: In order to explore exhaustively the feasible conformational space, we propose here an interval Branch-and-Prune algorithm (iBP) to solve the Distance Geometry Problem (DGP) associated to protein structure determination. This algorithm is based on a discretization of the problem obtained by recursively constructing a search space having the structure of a tree, and by verifying whether the generated atomic positions are feasible or not by making use of pruning devices. The pruning devices used here are directly related to features of protein conformations. CONCLUSIONS: We described the new algorithm iBP to generate protein conformations satisfying distance constraints, that would potentially allows a systematic exploration of the conformational space. The algorithm iBP has been applied on three α-helical peptides.
Andrea Cassioli, Benjamin Bardiaux, Guillaume Bouvier, Antonio Mucherino, Rafael Alves, Leo Liberti, Michael Nilges, Carlile Lavor, Therese E. Malliavin
BMC Bioinform.2
2007 ARIA2: Automated NOE assignment and data integration in NMR structure calculation
abstract
UNLABELLED: Modern structural genomics projects demand for integrated methods for the interpretation and storage of nuclear magnetic resonance (NMR) data. Here we present version 2.1 of our program ARIA (Ambiguous Restraints for Iterative Assignment) for automated assignment of nuclear Overhauser enhancement (NOE) data and NMR structure calculation. We report on recent developments, most notably a graphical user interface, and the incorporation of the object-oriented data model of the Collaborative Computing Project for NMR (CCPN). The CCPN data model defines a storage model for NMR data, which greatly facilitates the transfer of data between different NMR software packages. AVAILABILITY: A distribution with the source code of ARIA 2.1 is freely available at http://www.pasteur.fr/recherche/unites/Binfs/aria2.
Wolfgang Rieping, Michael Habeck, Benjamin Bardiaux, Aymeric Bernard, Therese E. Malliavin, Michael Nilges
Bioinform.3
2004 Data mining techniques to study the disulfide-bonding state in proteins: signal peptide is a strong descriptor
abstract
Abstract In the eucaryotic cell, the formation of disulfide bonds takes place in general inside the endoplasmic reticulum which provides a unique folding environment. The DisulfideDB database gathers information about this biological process with structural, evolutionary and neighborhood information on cysteines in proteins. Mining this information with an association rule discovery program permits to extract some strong rules for the prediction of the disulfide-bonding state of cysteines. Supplementary information: The web supplement to this paper, including the UML diagram of the database and some procedures used with the association rule discovery tool, may be found at http://www.nantes.inra.fr/centre/unites-recherche/urpvi/bioinformatique/publi.html.
Dominique Tessier, Benjamin Bardiaux, Colette Larré, Yves Popineau
Bioinform.2