How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
Citations since 2017
5 Research Items
PhD student in Comparative Bioinformatics at CRG. MSc in Bioinformatics. Computer Science soul (bachelor), where I get some international experience (Poland, USA and Brazil). Interested in sequence alignment, clustering algorithms, cloud computing, HPC and reproducibility analysis in general
August 2015 - December 2015
- We did an interdisciplinary approach, incorporating random generation, thermodynamics, sequence alignment, and multi-objective programming in order to create a web based application that produces libraries of temperature-dependent DNA sequences
Many fields of biology rely on the inference of accurate multiple sequence alignments (MSA) of biological sequences. Unfortunately, the problem of assembling an MSA is NP-complete thus limiting computation to approximate solutions using heuristics solutions. The progressive algorithm is one of the most popular frameworks for the computation of MSAs...
Multiple sequence alignments (MSAs) are used for structural1,2 and evolutionary predictions1,2, but the complexity of aligning large datasets requires the use of approximate solutions³, including the progressive algorithm⁴. Progressive MSA methods start by aligning the most similar sequences and subsequently incorporate the remaining sequences, fro...
Inferences derived from large multiple alignments of biological sequences are critical to many areas of biology, including evolution, genomics, biochemistry, and structural biology. However, the complexity of the alignment problem imposes the use of approximate solutions. The most common is the progressive algorithm, which starts by aligning the mo...
Start an implementation of the Research Object in Nextflow thanks to Google Summer of Code 2018