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.

Sumit Tarafder

dblp:326/4837 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › systems biology › metabolic network reconstruction
gap filling
0.612022
Figbird: a probabilistic method for filling gaps in genome assemblies · Bioinform. 2022
Bioinformatics and computational biology › sequence analysis › sequence assembly
genome assembly
0.612022
Figbird: a probabilistic method for filling gaps in genome assemblies · Bioinform. 2022

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

generative model · 0.6expectation-maximization · 0.6
YearPublicationVenuePosition
2022 Figbird: a probabilistic method for filling gaps in genome assemblies
abstract
MOTIVATION: Advances in sequencing technologies have led to the sequencing of genomes of a multitude of organisms. However, draft genomes of many of these organisms contain a large number of gaps due to the repeats in genomes, low sequencing coverage and limitations in sequencing technologies. Although there exists several tools for filling gaps, many of these do not utilize all information relevant to gap filling. RESULTS: Here, we present a probabilistic method for filling gaps in draft genome assemblies using second-generation reads based on a generative model for sequencing that takes into account information on insert sizes and sequencing errors. Our method is based on the expectation-maximization algorithm unlike the graph-based methods adopted in the literature. Experiments on real biological datasets show that this novel approach can fill up large portions of gaps with small number of errors and misassemblies compared to other state-of-the-art gap-filling tools. AVAILABILITY AND IMPLEMENTATION: The method is implemented using C++ in a software named 'Filling Gaps by Iterative Read Distribution (Figbird)', which is available at https://github.com/SumitTarafder/Figbird. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Sumit Tarafder, Swakkhar Shatabda, Atif Rahman 0001
Bioinform.1