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

Javad Ansarifar

dblp:191/1805 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 2 · 2 first-author

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
1 paper
Bioinformatics and computational biology · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › genomics › genome-wide association study
epistasis detection
0.412019
New algorithms for detecting multi-effect and multi-way epistatic interactions · Bioinform. 2019
Bioinformatics and computational biology › statistical genetics › gene-gene interaction
genetic interaction analysis
0.412019
New algorithms for detecting multi-effect and multi-way epistatic interactions · Bioinform. 2019
Bioinformatics and computational biology › statistical genetics › gene-gene interaction
higher-order epistasis detection
0.412019
New algorithms for detecting multi-effect and multi-way epistatic interactions · Bioinform. 2019

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

heuristic optimization · 0.4global optimization · 0.4
YearPublicationVenuePosition
2020 Integer Linear Programming Formulation for the Unified Duplication-Loss-Coalescence Model
Javad Ansarifar, Alexey Markin, Pawel Górecki 0001, Oliver Eulenstein
ISBRA1
2019 New algorithms for detecting multi-effect and multi-way epistatic interactions
abstract
MOTIVATION: Epistasis, which is the phenomenon of genetic interactions, plays a central role in many scientific discoveries. However, due to the combinatorial nature of the problem, it is extremely challenging to decipher the exact combinations of genes that trigger the epistatic effects. Many existing methods only focus on two-way interactions. Some of the most effective methods used machine learning techniques, but many were designed for special case-and-control studies or suffer from overfitting. We propose three new algorithms for multi-effect and multi-way epistases detection, with one guaranteeing global optimality and the other two being local optimization oriented heuristics. RESULTS: The computational performance of the proposed heuristic algorithm was compared with several state-of-the-art methods using a yeast dataset. Results suggested that searching for the global optimal solution could be extremely time consuming, but the proposed heuristic algorithm was much more effective and efficient than others at finding a close-to-optimal solution. Moreover, it was able to provide biological insight on the exact configurations of epistases, besides achieving a higher prediction accuracy than the state-of-the-art methods. AVAILABILITY AND IMPLEMENTATION: Data source was publicly available and details are provided in the text.
Javad Ansarifar, Lizhi Wang 0002
Bioinform.1