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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jaume Bertranpetit

dblp:81/795 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
0since 2021 · last 2015
0000-0003-0100-0590ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 7

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 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
population genetics
0.422015
Hierarchical boosting: a machine-learning framework to detect and classify hard selective sweeps in human populations · Bioinform. 2015
VCF2Networks: applying genotype networks to single-nucleotide variants data · Bioinform. 2015
Bioinformatics and computational biology › population genetics › selection detection
selective sweep detection
0.212015
Hierarchical boosting: a machine-learning framework to detect and classify hard selective sweeps in human populations · Bioinform. 2015
Bioinformatics and computational biology › population genetics › coalescent theory
ancestral recombination graph
0.112011
IRiS: Construction of ARG networks at genomic scales · Bioinform. 2011
Bioinformatics and computational biology › population genetics
population genomics
0.112011
IRiS: Construction of ARG networks at genomic scales · Bioinform. 2011
Bioinformatics and computational biology › molecular evolution
recombination detection
0.112011
IRiS: Construction of ARG networks at genomic scales · Bioinform. 2011
Bioinformatics and computational biology › statistical genetics › single nucleotide polymorphism analysis
SNP association analysis
0.112008
SNP analysis to results (SNPator): a web-based environment oriented to statistical genomics analyses upon SNP data · Bioinform. 2008
Bioinformatics and computational biology › biostatistics › statistical bioinformatics
statistical genomics
0.112008
SNP analysis to results (SNPator): a web-based environment oriented to statistical genomics analyses upon SNP data · Bioinform. 2008
Bioinformatics and computational biology
genetic epidemiology
0.012008
SNP analysis to results (SNPator): a web-based environment oriented to statistical genomics analyses upon SNP data · Bioinform. 2008

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

machine learning classification · 0.2hierarchical boosting · 0.2local sequence topology · 0.1haplotype analysis · 0.1quality control · 0.1association testing · 0.1
YearPublicationVenuePosition
2015 VCF2Networks: applying genotype networks to single-nucleotide variants data
abstract
SUMMARY: A wealth of large-scale genome sequencing projects opens the doors to new approaches to study the relationship between genotype and phenotype. One such opportunity is the possibility to apply genotype networks analysis to population genetics data. Genotype networks are a representation of the set of genotypes associated with a single phenotype, and they allow one to estimate properties such as the robustness of the phenotype to mutations, and the ability of its associated genotypes to evolve new adaptations. So far, though, genotype networks analysis has rarely been applied to population genetics data. To help fill this gap, here we present VCF2Networks, a tool to determine and study genotype network structure from single-nucleotide variant data. AVAILABILITY AND IMPLEMENTATION: VCF2Networks is available at https://bitbucket.org/dalloliogm/vcf2networks. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Giovanni Marco Dall'Olio, Ali R. Vahdati, Jaume Bertranpetit, Hafid Laayouni
Bioinform.3
2015 Hierarchical boosting: a machine-learning framework to detect and classify hard selective sweeps in human populations
abstract
MOTIVATION: Detecting positive selection in genomic regions is a recurrent topic in natural population genetic studies. However, there is little consistency among the regions detected in several genome-wide scans using different tests and/or populations. Furthermore, few methods address the challenge of classifying selective events according to specific features such as age, intensity or state (completeness). RESULTS: We have developed a machine-learning classification framework that exploits the combined ability of some selection tests to uncover different polymorphism features expected under the hard sweep model, while controlling for population-specific demography. As a result, we achieve high sensitivity toward hard selective sweeps while adding insights about their completeness (whether a selected variant is fixed or not) and age of onset. Our method also determines the relevance of the individual methods implemented so far to detect positive selection under specific selective scenarios. We calibrated and applied the method to three reference human populations from The 1000 Genome Project to generate a genome-wide classification map of hard selective sweeps. This study improves detection of selective sweep by overcoming the classical selection versus no-selection classification strategy, and offers an explanation to the lack of consistency observed among selection tests when applied to real data. Very few signals were observed in the African population studied, while our method presents higher sensitivity in this population demography. AVAILABILITY AND IMPLEMENTATION: The genome-wide results for three human populations from The 1000 Genomes Project and an R-package implementing the 'Hierarchical Boosting' framework are available at http://hsb.upf.edu/.
Marc Pybus, Pierre Luisi, Giovanni Marco Dall'Olio, Manu Uzkudun, Hafid Laayouni, Jaume Bertranpetit, Johannes Engelken
Bioinform.6
2011 IRiS: Construction of ARG networks at genomic scales
abstract
SUMMARY: Given a set of extant haplotypes IRiS first detects high confidence recombination events in their shared genealogy. Next using the local sequence topology defined by each detected event, it integrates these recombinations into an ancestral recombination graph. While the current system has been calibrated for human population data, it is easily extendible to other species as well. AVAILABILITY: IRiS (Identification of Recombinations in Sequences) binary files are available for non-commercial use in both Linux and Microsoft Windows, 32 and 64 bit environments from https://researcher.ibm.com/researcher/view_project.php?id = 2303 CONTACT: [email protected].
Asif Javed, Marc Pybus, Marta Melé, Filippo Utro, Jaume Bertranpetit, Francesc Calafell, Laxmi Parida
Bioinform.5
2011 Ten Simple Rules for Getting Help from Online Scientific Communities
abstract
International audience
Giovanni Marco Dall'Olio, Jacopo Marino, Michael Schubert, Kevin L. Keys, Melanie I. Stefan, Colin S. Gillespie, Pierre Poulain, Khader Shameer, Robert Sugar, Brandon M. Invergo, Lars Juhl Jensen, Jaume Bertranpetit, Hafid Laayouni
PLoS Comput. Biol.12
2010 A New Method to Reconstruct Recombination Events at a Genomic Scale
abstract
Recombination is one of the main forces shaping genome diversity, but the information it generates is often overlooked. A recombination event creates a junction between two parental sequences that may be transmitted to the subsequent generations. Just like mutations, these junctions carry evidence of the shared past of the sequences. We present the IRiS algorithm, which detects past recombination events from extant sequences and specifies the place of each recombination and which are the recombinants sequences. We have validated and calibrated IRiS for the human genome using coalescent simulations replicating standard human demographic history and a variable recombination rate model, and we have fine-tuned IRiS parameters to simultaneously optimize for false discovery rate, sensitivity, and accuracy in placing the recombination events in the sequence. Newer recombinations overwrite traces of past ones and our results indicate more recent recombinations are detected by IRiS with greater sensitivity. IRiS analysis of the MS32 region, previously studied using sperm typing, showed good concordance with estimated recombination rates. We also applied IRiS to haplotypes for 18 X-chromosome regions in HapMap Phase 3 populations. Recombination events detected for each individual were recoded as binary allelic states and combined into recotypes. Principal component analysis and multidimensional scaling based on recotypes reproduced the relationships between the eleven HapMap Phase III populations that can be expected from known human population history, thus further validating IRiS. We believe that our new method will contribute to the study of the distribution of recombination events across the genomes and, for the first time, it will allow the use of recombination as genetic marker to study human genetic variation.
Marta Melé, Asif Javed, Marc Pybus, Francesc Calafell, Laxmi Parida, Jaume Bertranpetit
PLoS Comput. Biol.6
2009 Minimizing recombinations in consensus networks for phylogeographic studies
abstract
BACKGROUND: We address the problem of studying recombinational variations in (human) populations. In this paper, our focus is on one computational aspect of the general task: Given two networks G1 and G2, with both mutation and recombination events, defined on overlapping sets of extant units the objective is to compute a consensus network G3 with minimum number of additional recombinations. We describe a polynomial time algorithm with a guarantee that the number of computed new recombination events is within = sz(G1, G2) (function sz is a well-behaved function of the sizes and topologies of G1 and G2) of the optimal number of recombinations. To date, this is the best known result for a network consensus problem. RESULTS: Although the network consensus problem can be applied to a variety of domains, here we focus on structure of human populations. With our preliminary analysis on a segment of the human Chromosome X data we are able to infer ancient recombinations, population-specific recombinations and more, which also support the widely accepted 'Out of Africa' model. These results have been verified independently using traditional manual procedures. To the best of our knowledge, this is the first recombinations-based characterization of human populations. CONCLUSION: We show that our mathematical model identifies recombination spots in the individual haplotypes; the aggregate of these spots over a set of haplotypes defines a recombinational landscape that has enough signal to detect continental as well as population divide based on a short segment of Chromosome X. In particular, we are able to infer ancient recombinations, population-specific recombinations and more, which also support the widely accepted 'Out of Africa' model. The agreement with mutation-based analysis can be viewed as an indirect validation of our results and the model. Since the model in principle gives us more information embedded in the networks, in our future work, we plan to investigate more non-traditional questions via these structures computed by our methodology.
Laxmi Parida, Asif Javed, Marta Melé, Francesc Calafell, Jaume Bertranpetit
BMC Bioinform.5
2008 SNP analysis to results (SNPator): a web-based environment oriented to statistical genomics analyses upon SNP data
abstract
UNLABELLED: Single nucleotide polymorphisms (SNPs) are the most widely used marker in studies to assess associations between genetic variants and complex traits or diseases. They are also becoming increasingly important in the study of the evolution and history of humans and other species. The analysis and processing of SNPs obtained thanks to high-throughput technologies imply the time consuming and costly use of different, complex and usually format-incompatible software. SNPator is a user-friendly web-based SNP data analysis suite that integrates, among many other algorithms, the most common steps of a SNP association study. It frees the user from the need to have large computer facilities and an in depth knowledge of genetic software installation and management. Genotype data is directly read from the output files of the usual genotyping platforms. Phenotypic data on the samples can also be easily uploaded. Many different quality control and analysis procedures can be performed either by using built-in SNPator algorithms or by calling standard genetic software. AVAILABILITY: Access is granted from the SNPator webpage http://www.snpator.org.
Carlos Morcillo-Suarez, Josep Alegre, Ricardo Sangros, Elodie Gazave, Rafael de Cid, Roger Milne, Jorge Amigo, Anna Ferrer-Admetlla, Andrés Moreno-Estrada, Michelle Gardner, Ferran Casals, Anna Pérez-Lezaun, David Comas, Elena Bosch, Francesc Calafell, Jaume Bertranpetit, Arcadi Navarro
Bioinform.16