Pablo Mier

Dr. Pablo Mier

Johannes Gutenberg University Mainz
orcid

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 October 2019 in Nucleic Acids Research
Verified
Journal Article
Open access
PDF file
OTOle K Tørresen
Ole K Tørresen
BSBastiaan Star
Bastiaan Star
Pablo MierPablo Mier
Pablo Mier
Miguel AndradeMiguel Andrade
Miguel Andrade
ABAlex Bateman
Alex Bateman
DLDirk Linke
Dirk Linke
The widespread occurrence of repetitive stretches of DNA in genomes of organisms across the tree of life imposes fundamental challenges for sequencing, genome assembly, and automated annotation of genes and proteins. This multi-level problem can lead to errors in genome and protein databases that are often not recognized or acknowledged. As a consequence, end users working with sequences with repetitive regions are faced with ‘ready-to-use’ deposited data whose trustworthiness is difficult to determine, let alone to quantify. Here, we provide a review of the problems associated with tandem repeat sequences that originate from different stages during the sequencing-assembly-annotation-deposition workflow, and that may proliferate in public database repositories affecting all downstream analyses. As a case study, we provide examples of the Atlantic cod genome, whose sequencing and assembly were hindered by a particularly high prevalence of tandem repeats. We complement this case study with examples from other species, where mis-annotations and sequencing errors have propagated into protein databases. With this review, we aim to raise the awareness level within the community of database users, and alert scientists working in the underlying workflow of database creation that the data they omit or improperly assemble may well contain important biological information valuable to others.

18 May 2020 in Nucleic Acids Research
Verified
Journal Article
Open access
PJPatryk Jarnot
Patryk Jarnot
JZJoanna Ziemska-Legiecka
Joanna Ziemska-Legiecka
LDLaszlo Dobson
Laszlo Dobson
MMMatthew Merski
Matthew Merski
Pablo MierPablo Mier
Pablo Mier
AGAleksandra Gruca
Aleksandra Gruca
Low complexity regions (LCRs) in protein sequences are characterized by a less diverse amino acid composition compared to typically observed sequence diversity. Recent studies have shown that LCRs may co-occur with intrinsically disordered regions, are highly conserved in many organisms, and often play important roles in protein functions and in diseases. In previous decades, several methods have been developed to identify regions with LCRs or amino acid bias, but most of them as stand-alone applications and currently there is no web-based tool which allows users to explore LCRs in protein sequences with additional functional annotations. We aim to fill this gap by providing PlaToLoCo - PLAtform of TOols for LOw COmplexity—a meta-server that integrates and collects the output of five different state-of-the-art tools for discovering LCRs and provides functional annotations such as domain detection, transmembrane segment prediction, and calculation of amino acid frequencies. In addition, the union or intersection of the results of the search on a query sequence can be obtained. By developing the PlaToLoCo meta-server, we provide the community with a fast and easily accessible tool for the analysis of LCRs with additional information included to aid the interpretation of the results. The PlaToLoCo platform is available at: http://platoloco.aei.polsl.pl/.

23 March 2020 in Briefings in Bioinformatics
Verified
Journal Article
Open access
PDF file
Pablo MierPablo Mier
Pablo Mier
LPLisanna Paladin
Lisanna Paladin
STStella Tamana
Stella Tamana
SPSophia Petrosian
Sophia Petrosian
BHBorbála Hajdu-Soltész
Borbála Hajdu-Soltész
Miguel AndradeMiguel Andrade
Miguel Andrade
There are multiple definitions for low complexity regions (LCRs) in protein sequences, with all of them broadly considering LCRs as regions with fewer amino acid types compared to an average composition. Following this view, LCRs can also be defined as regions showing composition bias. In this critical review, we focus on the definition of sequence complexity of LCRs and their connection with structure. We present statistics and methodological approaches that measure low complexity (LC) and related sequence properties. Composition bias is often associated with LC and disorder, but repeats, while compositionally biased, might also induce ordered structures. We illustrate this dichotomy, and more generally the overlaps between different properties related to LCRs, using examples. We argue that statistical measures alone cannot capture all structural aspects of LCRs and recommend the combined usage of a variety of predictive tools and measurements. While the methodologies available to study LCRs are already very advanced, we foresee that a more comprehensive annotation of sequences in the databases will enable the improvement of predictions and a better understanding of the evolution and the connection between structure and function of LCRs. This will require the use of standards for the generation and exchange of data describing all aspects of LCRs.Short There are multiple definitions for low complexity regions (LCRs) in protein sequences. In this critical review, we focus on the definition of sequence complexity of LCRs and their connection with structure. We present statistics and methodological approaches that measure low complexity (LC) and related sequence properties. Composition bias is often associated with LC and disorder, but repeats, while compositionally biased, might also induce ordered structures. We illustrate this dichotomy, plus overlaps between different properties related to LCRs, using examples.

22 July 2016 in Scientific Reports
Verified
Journal Article
Open access
GAGregorio Alanis-Lobato
Gregorio Alanis-Lobato
Pablo MierPablo Mier
Pablo Mier
MAMiguel A. Andrade-Navarro
Miguel A. Andrade-Navarro
The different factors involved in the growth process of complex networks imprint valuable information in their observable topologies. How to exploit this information to accurately predict structural network changes is the subject of active research. A recent model of network growth sustains that the emergence of properties common to most complex systems is the result of certain trade-offs between node birth-time and similarity. This model has a geometric interpretation in hyperbolic space, where distances between nodes abstract this optimisation process. Current methods for network hyperbolic embedding search for node coordinates that maximise the likelihood that the network was produced by the afore-mentioned model. Here, a different strategy is followed in the form of the Laplacian-based Network Embedding, a simple yet accurate, efficient and data driven manifold learning approach, which allows for the quick geometric analysis of big networks. Comparisons against existing embedding and prediction techniques highlight its applicability to network evolution and link prediction.

29 April 2020 in EMBO Reports
Verified
Journal Article
Closed access
PDF file
JLJessica Leismann
Jessica Leismann
MSMariangela Spagnuolo
Mariangela Spagnuolo
MPMihika Pradhan
Mihika Pradhan
LWLudivine Wacheul
Ludivine Wacheul
MVMinh Anh Vu
Minh Anh Vu
JRJean-Yves Roignant
Jean-Yves Roignant

1 July 2020 in Structure
Verified
Journal Article
Closed access
AUAnnika Urbanek
Annika Urbanek
MPMatija Popovic
Matija Popovic
AMAnna Morató
Anna Morató
AEAlejandro Estaña
Alejandro Estaña
CECarlos A. Elena-Real
Carlos A. Elena-Real
Pau BernadoPau Bernado
Pau Bernado