Demo Data from EDBT 2026 / reviewers in the wild / expert
Damien Devos
dblp:54/3818 · also Damien P. Devos
· DBLP profile ↗
8ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0002-9453-4753ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 8 · 2 since 2021
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 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › biological database
protein database |
0.9 | 1 | 2025 | BAV-LLPS: a database of bacterial, archaea, and virus liquid-liquid phase separation proteins · Bioinform. 2025 |
Bioinformatics and computational biology
protein structure prediction |
0.9 | 1 | 2025 | BAV-LLPS: a database of bacterial, archaea, and virus liquid-liquid phase separation proteins · Bioinform. 2025 |
Bioinformatics and computational biology › proteomics › computational proteomics
proteome annotation |
0.3 | 1 | 2018 | ICBdocker: a Docker image for proteome annotation and visualization · Bioinform. 2018 |
Bioinformatics and computational biology › proteomics › computational proteomics
proteomics data visualization |
0.1 | 1 | 2018 | ICBdocker: a Docker image for proteome annotation and visualization · Bioinform. 2018 |
Bioinformatics and computational biology › genome annotation
annotation quality assessment |
0.0 | 1 | 2003 | Evaluation of annotation strategies using an entire genome sequence · Bioinform. 2003 |
Bioinformatics and computational biology › genome annotation
functional annotation |
0.0 | 1 | 2003 | Evaluation of annotation strategies using an entire genome sequence · Bioinform. 2003 |
Bioinformatics and computational biology
genome annotation |
0.0 | 1 | 2003 | Evaluation of annotation strategies using an entire genome sequence · Bioinform. 2003 |
Bioinformatics and computational biology › protein structure analysis
protein structure validation |
0.0 | 1 | 1997 | ANOLEA: A WWW Server to Assess Protein Structures · ISMB 1997 |
Bioinformatics and computational biology › genome annotation
automatic annotation |
0.0 | 1 | 2003 | Evaluation of annotation strategies using an entire genome sequence · Bioinform. 2003 |
Methods — techniques the papers use, named apart from their topics
sequence similarity search · 0.9alphafold2 · 0.9python/perl pipeline · 0.3docker containerization · 0.3comparative analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | BAV-LLPS: a database of bacterial, archaea, and virus liquid-liquid phase separation proteinsabstractMOTIVATION: Liquid-liquid phase separation (LLPS) is a key process underlying the formation of biomolecular condensates, such as membrane-less organelles, that compartmentalize biochemical processes inside the cells. While LLPS has been extensively studied in eukaryotes, its role in bacteria, archaea, and viruses remains far less characterized. Recent studies in bacteria have revealed that LLPS-driven condensates play critical roles in RNA processing, stress response, and pathogenicity. Similarly, many viruses exploit LLPS to facilitate crucial steps in their infection cycles, including viral entry, genome replication, assembly, and host immune evasion. RESULTS: In this work, we introduce a hand-curated database of LLPS proteins from bacteria, archaea, and viruses (BAV-LLPS Database). This resource, extended through sequence similarity searches, comprises over 5000 proteins and integrates diverse data including biological annotations, sequence features, predicted disordered regions, LLPS per site probability, and AlphaFold2-based structural models. Additionally, our web server enables users to explore both the curated and homologous derived datasets, providing a platform to uncover evolutionary relationships and intrinsic and differential properties of LLPS proteins across various taxonomic groups. This work seeks to deepen our understanding of LLPS mechanisms beyond eukaryotic organisms, emphasizing their significance across diverse life forms. It also aims to foster the development of specialized predictive tools that will facilitate the exploration and characterization of LLPS processes in a wide array of living organisms, thereby contributing to advancements in both fundamental biological research and applied biomedical sciences. AVAILABILITY AND IMPLEMENTATION: BAV-LLPS DB is freely accessible at https://bav-llps-db.bioinformatica.org/. The data can be retrieved from the website. The source code of the database can be downloaded from https://bav-llps-db.bioinformatica.org/download. Cecilia B. Rodriguez, Ronaldo Romario Tunque Cahui, Nicolás Demitroff, Layla Hirsh, Damien Devos, Graciela Boccaccio, Gustavo D. Parisi |
Bioinform. | 5 |
| 2024 | The neglected giants: Uncovering the prevalence and functional groups of huge proteins in proteomesabstractAn often-overlooked aspect of biology is formed by the outliers of the protein length distribution, specifically those proteins with more than 5000 amino acids, which we refer to as huge proteins (HPs). By examining UniprotKB, we discovered more than 41 000 HPs throughout the tree of life, with the majority found in eukaryotes. Notably, the phyla with the highest propensity for HPs are Apicomplexa and Fornicata. Moreover, we observed that certain bacteria, such as Elusimicrobiota or Planctomycetota, have a higher tendency for encoding HPs, even more than the average eukaryote. To investigate if these macro-polypeptides represent "real" proteins, we explored several indirect metrics. Additionally, orthology analyses reveals thousands of clusters of homologous sequences of HPs, revealing functional groups related to key cellular processes such as cytoskeleton organization and functioning as chaperones or as E3-ubiquitin ligases in eukaryotes. In the case of bacteria, the major clusters have functions related to non-ribosomomal peptide synthesis/polyketide synthesis, followed by pathogen-host attachment or recognition surface proteins. Further exploration of the annotations for each HPs supported the previously identified functional groups. These findings underscore the need for further investigation of the cellular and ecological roles of these HPs and their potential impact on biology and biotechnology. Anibal S. Amaral, Damien Devos |
PLoS Comput. Biol. | 2 |
| 2018 | ICBdocker: a Docker image for proteome annotation and visualizationabstractSummary: We introduce ICBdocker, a Docker environment that allows the annotation of functional and structural features of proteomes through a Python/Perl pipeline. DataTables pages make it easy to set up a web-resource for research groups with a focus on the same organisms or datasets. The results are available as tab-separated values files and HTML, allowing data analysis and browsing. The pipeline focuses on modularity and scalability, with capability of integrating with multi-processing and high-performance computing clusters. Availability and implementation: ICBdocker is freely available on DockerHub at https://hub.docker.com/r/bordin89/icb/ Source code and documentation are available on GitHub at: https://github.com/bordin89/ICB_docker. Nicola Bordin, Damien Devos |
Bioinform. | 2 |
| 2018 | 4Cin: A computational pipeline for 3D genome modeling and virtual Hi-C analyses from 4C dataabstractThe use of 3C-based methods has revealed the importance of the 3D organization of the chromatin for key aspects of genome biology. However, the different caveats of the variants of 3C techniques have limited their scope and the range of scientific fields that could benefit from these approaches. To address these limitations, we present 4Cin, a method to generate 3D models and derive virtual Hi-C (vHi-C) heat maps of genomic loci based on 4C-seq or any kind of 4C-seq-like data, such as those derived from NG Capture-C. 3D genome organization is determined by integrative consideration of the spatial distances derived from as few as four 4C-seq experiments. The 3D models obtained from 4C-seq data, together with their associated vHi-C maps, allow the inference of all chromosomal contacts within a given genomic region, facilitating the identification of Topological Associating Domains (TAD) boundaries. Thus, 4Cin offers a much cheaper, accessible and versatile alternative to other available techniques while providing a comprehensive 3D topological profiling. By studying TAD modifications in genomic structural variants associated to disease phenotypes and performing cross-species evolutionary comparisons of 3D chromatin structures in a quantitative manner, we demonstrate the broad potential and novel range of applications of our method. Ibai Irastorza-Azcarate, Rafael D. Acemel, Juan J. Tena, Ignacio Maeso, José Luis Gómez-Skarmeta, Damien Devos |
PLoS Comput. Biol. | 6 |
| 2016 | Efficient and automated large-scale detection of structural relationships in proteins with a flexible alignerabstractBACKGROUND: The total number of known three-dimensional protein structures is rapidly increasing. Consequently, the need for fast structural search against complete databases without a significant loss of accuracy is increasingly demanding. Recently, TopSearch, an ultra-fast method for finding rigid structural relationships between a query structure and the complete Protein Data Bank (PDB), at the multi-chain level, has been released. However, comparable accurate flexible structural aligners to perform efficient whole database searches of multi-domain proteins are not yet available. The availability of such a tool is critical for a sustainable boosting of biological discovery. RESULTS: Here we report on the development of a new method for the fast and flexible comparison of protein structure chains. The method relies on the calculation of 2D matrices containing a description of the three-dimensional arrangement of secondary structure elements (angles and distances). The comparison involves the matching of an ensemble of substructures through a nested-two-steps dynamic programming algorithm. The unique features of this new approach are the integration and trade-off balancing of the following: 1) speed, 2) accuracy and 3) global and semiglobal flexible structure alignment by integration of local substructure matching. The comparison, and matching with competitive accuracy, of one medium sized (250-aa) query structure against the complete PDB database (216,322 protein chains) takes about 8 min using an average desktop computer. The method is at least 2-3 orders of magnitude faster than other tested tools with similar accuracy. We validate the performance of the method for fold and superfamily assignment in a large benchmark set of protein structures. We finally provide a series of examples to illustrate the usefulness of this method and its application in biological discovery. CONCLUSIONS: The method is able to detect partial structure matching, rigid body shifts, conformational changes and tolerates substantial structural variation arising from insertions, deletions and sequence divergence, as well as structural convergence of unrelated proteins. Fernando I. Gutiérrez, Felipe Rodriguez-Valenzuela, Ignacio L. Ibarra, Damien Devos, Francisco Melo 0001 |
BMC Bioinform. | 4 |
| 2015 | Ten Simple Rules for Organizing an UnconferenceabstractAn academic conference is a traditional platform for researchers and professionals to network and learn about recent developments and trends in a particular academic field [1–4]. Typically, the organizing committees and sponsors decide the main theme and sub-topics of the conference and select the presenters based on peer-reviewed papers [5]. The selected speakers usually share their research with a large audience by means of presentations and posters. However, the most stimulating discussions generally take place over coffee breaks when attendees can interact with each other and discuss various topics, including their own research interests, in a more informal manner [1, 6, 7], while expanding their own professional networks. An emphasis on facilitating such informal/networking interactions is a central focus of “unconventional conferences”—or “unconferences.” Aidan Budd, Holger Dinkel, Manuel Corpas, Jonathan C. Fuller, Laura Rubinat-Ripoll, Damien Devos, Pierre H. Khoueiry, Konrad U. Förstner, Fotis Georgatos, Francis Rowland, Malvika Sharan, Janos X. Binder, Tom Grace, Karyn Traphagen, Adam Gristwood, Natasha T. Wood |
PLoS Comput. Biol. | 6 |
| 2003 | Evaluation of annotation strategies using an entire genome sequenceabstractAbstract 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. | 15 |
| 1997 | ANOLEA: A WWW Server to Assess Protein Structures
Francisco Melo 0001, Damien Devos, Eric Depiereux, Ernest Feytmans |
ISMB | 2 |