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

Myriam Brossard

dblp:209/7311 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0003-4144-3978ORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 2

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
2 papers
Bioinformatics and computational biology · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › population genetics
haplotype block detection
0.412019
gpart: human genome partitioning and visualization of high-density SNP data by identifying haplotype blocks · Bioinform. 2019
Bioinformatics and computational biology › population genetics
linkage disequilibrium
0.412019
gpart: human genome partitioning and visualization of high-density SNP data by identifying haplotype blocks · Bioinform. 2019
Bioinformatics and computational biology
population genetics
0.412019
gpart: human genome partitioning and visualization of high-density SNP data by identifying haplotype blocks · Bioinform. 2019
Bioinformatics and computational biology › genomics
genome-wide association study
0.312017
SigMod: an exact and efficient method to identify a strongly interconnected disease-associated module in a gene network · Bioinform. 2017
Bioinformatics and computational biology › genomics
genome visualization
0.112019
gpart: human genome partitioning and visualization of high-density SNP data by identifying haplotype blocks · Bioinform. 2019

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

clustering algorithms · 0.4graph min-cut · 0.3binary quadratic optimization · 0.3
YearPublicationVenuePosition
2019 gpart: human genome partitioning and visualization of high-density SNP data by identifying haplotype blocks
abstract
SUMMARY: For the analysis of high-throughput genomic data produced by next-generation sequencing (NGS) technologies, researchers need to identify linkage disequilibrium (LD) structure in the genome. In this work, we developed an R package gpart which provides clustering algorithms to define LD blocks or analysis units consisting of SNPs. The visualization tool in gpart can display the LD structure and gene positions for up to 20 000 SNPs in one image. The gpart functions facilitate construction of LD blocks and SNP partitions for vast amounts of genome sequencing data within reasonable time and memory limits in personal computing environments. AVAILABILITY AND IMPLEMENTATION: The R package is available at https://bioconductor.org/packages/gpart. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Sun-Ah Kim, Myriam Brossard, Delnaz Roshandel, Andrew D. Paterson, Shelley B. Bull, Yun Joo Yoo
Bioinform.2
2017 SigMod: an exact and efficient method to identify a strongly interconnected disease-associated module in a gene network
abstract
MOTIVATION: Apart from single marker-based tests classically used in genome-wide association studies (GWAS), network-assisted analysis has become a promising approach to identify a set of genes associated with disease. To date, most network-assisted methods aim at finding genes connected in a background network, whatever the density or strength of their connections. This can hamper the findings as sparse connections are non-robust against noise from either the GWAS results or the network resource. RESULTS: We present SigMod, a novel and efficient method integrating GWAS results and gene network to identify a strongly interconnected gene module enriched in high association signals. Our method is formulated as a binary quadratic optimization problem, which can be solved exactly through graph min-cut algorithms. Compared to existing methods, SigMod has several desirable properties: (i) edge weights quantifying confidence of connections between genes are taken into account, (ii) the selection path can be computed rapidly, (iii) the identified gene module is strongly interconnected, hence includes genes of high functional relevance, and (iv) the method is robust against noise from either the GWAS results or the network resource. We applied SigMod to both simulated and real data. It was found to outperform state-of-the-art network-assisted methods in identifying disease-associated genes. When SigMod was applied to childhood-onset asthma GWAS results, it successfully identified a gene module enriched in consistently high association signals and made of functionally related genes that are biologically relevant for asthma. AVAILABILITY AND IMPLEMENTATION: An R package SigMod is available at: https://github.com/YuanlongLiu/SigMod. CONTACT: [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Yuanlong Liu, Myriam Brossard, Damian Roqueiro, Patricia Margaritte-Jeannin, Chloé Sarnowski, Emmanuelle Bouzigon, Florence Demenais
Bioinform.2