• Aucun résultat trouvé

Reactive pipelines for integrated structural bioinformatics resources

N/A
N/A
Protected

Academic year: 2021

Partager "Reactive pipelines for integrated structural bioinformatics resources"

Copied!
2
0
0

Texte intégral

(1)

HAL Id: hal-01925064

https://hal.inria.fr/hal-01925064 Submitted on 16 Nov 2018

HAL is a multi-disciplinary open access

archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers.

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

Reactive pipelines for integrated structural bioinformatics resources

Isaure Chauvot de Beauchêne, Sjoerd de Vries

To cite this version:

Isaure Chauvot de Beauchêne, Sjoerd de Vries. Reactive pipelines for integrated structural bioin-formatics resources. 3D-BioInfo: Launch Meeting for a proposed ELIXIR Community in Structural Bioinformatics, Oct 2018, Basel, Switzerland. �hal-01925064�

(2)

Technologies developed at the

RPBS

platform:

A server to map the checksum of (meta)data to external URLs where they can be downloaded.

Syntactic ontologies (using a superset of JSON schema) to describe the input and output data formats of structural biology tools.

Implementation of a universal transformer. Its input data uniquely and deterministically defines the result of any computation. The transformer is universal: source code is just another kind of input data.

Tracking the dependencies of a computation (incl. code dependencies) into a computation tree of data checksums and universal transformations. Any structural biology tool can be decomposed and described in this way.

A server to map the checksum of a result to its computation tree. As the inputs are often computation results themselves, this allows a computation to be tracked all the way down to the original experimental data.

Reactive pipelines to re-evaluate computation trees as they change. This allows the automatic re-computation of a structure prediction if any of its inputs change (e. g. because of new experimental data, or if the tool itself is improved).

Sjoerd J. de Vries

Parisian Structural Bioinformatics Resource (

RPBS

) platform, INSERM UMR-S973 / Paris Diderot University, France.

Reactive pipelines

for integrated structural bioinformatics resources

Introduction

Structural bioinformatics is fragmented. Structure prediction tools use a plethora

of formats to describe protein models (rotation matrices, normal mode amplitudes, discretized rotamers). When converting to simple atomic coordinates, much information is lost.

Tools are typically full-stack protocols: sampling, scoring and refinement all

occur within the same tool, and return few models to be used directly by biologists. This makes tool integration extremely difficult.

Databases are full of implicit dependencies, including time. For example, a

PDB code 1XYZ may point to different coordinates over time, changing when the PDB entry gets updated. Then, computations are not reproducible from input parameters with PDB codes.

* A checksum is a small-sized datum derived from a block of digital data to verify data integrity. It has significantly different value even for small changes in the digital data.

Wilkinson et al., 2016. 755 citations

Findability

Accessibility

Interoperability

Re-usability

Integration of structural bioinformatics resources is a major challenge. FAIR principles are an

excellent direction towards establishing intra-discipline cohesion, and to link up with neighboring

scientific disciplines. Eventually, this offers the possibility to move beyond the standard publication

model, from manuscripts with imprecise "Results" and "Materials & Methods" sections towards

machine-readable scientific resources: interactive, reproducible, searchable, and connectible.

FAIR principles ...

Computation tree

data + code

transformer

results

checksum + checksum

checksum

data

checksum

metadata

● Topology of the tree

● Language of source code ● Execution environment

(Meta)data are assigned globally unique persistent identifiers

● Data, coordinates: https://files.rcsb.org/download/1AVX.pdb

● Data, structure factors: https://files.rcsb.org/download/1AVX-sf.cif ● Meta-data: https://www.rcsb.org/structure/1AVX

X-ray resolution, 2D structure, Link to Uniprot ...

(Meta)data are retrievable by their identifier

Metadata are accessible even when data no longer available

Metadata are small; data can be hosted at Dataverse, using torrents...

(Meta)data use a formal, accessible, shared, and broadly applicable language for knowledge representation (semantic ontology)

Example: OWL language

DataPropertyAssertion(:id :MyStructure :www.rcsb.org/structure/1PKG) ObjectPropertyAssertion( :protein :MyStructure :cKIT )

ClassAssertion( :Auto-Phosphorylating-Kinase :cKIT

SubClassOf(:Auto-Phosphorylating-Kinase) ObjectHasSelf( :phosphorylate )

(Meta)data are associated with detailed provenance

Where does it come from? Was it transformed?

Results data

Identifier for input data :

- exp. data (e.g. prot. structures) - human-decision data

Reproducibility: Annotated “computation trees” (see below) can make computations perfectly

reproducible from input

Reactivity: Computation trees can automatically re-compute a structure prediction if any input changes. ● True interoperability: by building and combining computation trees.

Caching: if (part of) a computation tree has already been performed, results can be read from data

storage.

Interactivity: User can change any data, code, or even the topology, and just evaluate the part of which

the dependencies have changed, while the service as a whole is running.

Delegated computing: The computation tree being modular, it can be evaluated in parallel, on many

cores: it just wait for its direct dependencies before launching a transformation.

Perspectives

Labs should focus on single-purpose tools that work well and can be integrated by others. Tools should be decomposed into their constituent stages. At each stage, large numbers of models should be kept, to be re-ranked or filtered by downstream tools (e. g. using exp. data).

Benefits

Challenges

These changes will provide many advantages, but their realisation in

structural bioinformatics needs to tackle several challenges. This requires

adaptation of the FAIR principles toward the realities of structural

bioinformatics.

To be deterministic and reproducible, computations should be defined as a computation

tree of connected data in the form of checksums. Code and metadata are part of the tree.

Data should be defined by its value, not by a URL. These values should be stored as

checksums*.

A semantic ontology for protein structure is not sufficient to achieve interoperability. Syntactic

ontologies and their pairwise conversions for different protein model formats are necessary.

... adapted to 3D Bioinformatics

Tool interoperability:

Isaure Chauvot de Beauchêne

Université de Lorraine, CNRS, Inria, LORIA, F-54000 Nancy, France

Example: RNAlib pipeline

PDB Checksum for each structureList of structure codes

Metadata:

Experimental method,

resolution, protein family ...

Check for new or updated entry

Structure file External tool

Stored data

Cleaned up coordinates

RNA fragments coordinatesRNA

Protein coordinates binary coordinates Text coordinates PDBComplete Checksum code version 3dna [1] User parameters Checksum code version Fragment length clusters Clustering cutoff Selection criteria: Specific RNA structural library Rich PDB annotation ● structure level ● chain level

● nucleotide level Nucleotide-level

data Structure and interactions data sequence Result new entry json Docking

3D modeling RNA design Statistics Applications

RBP family 2D motifs ...

[1] Lu, Xiang-Jun, Harmen J. Bussemaker, and Wilma K. Olson. "DSSR: an integrated software tool for dissecting the spatial structure of RNA." Nucleic acids research 43.21 (2015): e142-e142.

Références

Documents relatifs

Working in pairs students have to answer a series of questions about some parametria. equations of lines

Pour cela, la séquence binaire correspondante s’obtient en considérant la représentation binaire du code ASCII de chaque caractère.. De plus, la séquence binaire codant le mot

[r]

Compute the oordinates of the point I , midpoint of segment AB.. 5.8 En utilisant la propriété de l'exerie préédent, déterminer parmi les

8.9 Using the property discovered in the previous exercise, decide whether the two vectors in each pair below are collinear or

Therefore, if F is going to be locally conjugate to a homogeneous map in a neighborhood of 0, each component of the critical locus and postcritical locus of F containing

In this sense Theorem 4.4 gives an anolog of Dynnikov coordinates originally defined for braid groups.

In this section we investigate framed local systems for groups that are isogenic to Sp(2n, R) as well as coordinates on their moduli space. We first describe the groups in Section