Atif Rahman 0001

dblp:10/1151-1 · also Atif Hasan Rahman 0001 · DBLP profile ↗
← Back
7ranked-venue papers
0as first author
4since 2021 · last 2025
0000-0003-1805-3971ORCID · verified

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

Artificial intelligence and machine learning · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 2 since 2021Computer networks · 1Security and privacy · 1 · 1 since 2021Theory of computation · 1

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
2025 An alignment-free method for phylogeny estimation using maximum likelihood
abstract
BACKGROUND: While alignment has traditionally been the primary approach for establishing homology prior to phylogenetic inference, alignment-free methods offer a simplified alternative, particularly beneficial when handling genome-wide data involving long sequences and complex events such as rearrangements. Moreover, alignment-free methods become crucial for data types like genome skims, where assembly is impractical. However, despite these benefits, alignment-free techniques have not gained widespread acceptance since they lack the accuracy of alignment-based techniques, primarily due to their reliance on simplified models of pairwise distance calculation. RESULTS: Here, we present a likelihood based alignment-free technique for phylogenetic tree construction. We encode the presence or absence of k-mers in genome sequences in a binary matrix, and estimate phylogenetic trees using a maximum likelihood approach. A likelihood based alignment-free method for phylogeny estimation is implemented for the first time in a software named PEAFOWL, which is available at: https://github.com/hasin-abrar/Peafowl-repo . We analyze the performance of our method on seven real datasets and compare the results with the state of the art alignment-free methods. CONCLUSIONS: Results suggest that our method is competitive with existing alignment-free tools. This indicates that maximum likelihood based alignment-free methods may in the future be refined to outperform alignment-free methods relying on distance calculation as has been the case in the alignment-based setting.
Tasfia Zahin, Md. Hasin Abrar, Mizanur Rahman Jewel, Tahrina Tasnim, Md. Shamsuzzoha Bayzid, Atif Rahman 0001
BMC Bioinform.6
2024 MAlign: Explainable static raw-byte based malware family classification using sequence alignment
Shoumik Saha, Atif Rahman 0001
Comput. Secur.3
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.4
2022 Multiobjective Formulation of Multiple Sequence Alignment for Phylogeny Inference
abstract
Multiple sequence alignment (MSA) is a preliminary task for estimating phylogenies. It is used for homology inference among the sequences of a set of species. Generally, the MSA task is handled as a single-objective optimization process. The alignments computed under one criterion may be different from the alignments generated by other criteria, inferring discordant homologies and thus leading to different hypothesized evolutionary histories relating the sequences. The multiobjective (MO) formulation of MSA has recently been advocated by several researchers, to address this issue. An MO approach independently optimizes multiple (often conflicting) objective functions at the same time and outputs a set of competitive alignments. However, no conceptual or experimental rational from a real-world application perspective has been reported so far for any MO formulation of MSA. This article work investigates the impact of MO formulation in the context of an important scientific problem, namely, phylogeny estimation. Employing popular evolutionary MO algorithms, we show that: 1) trees inferred based on alignments produced by the existing MSA methods used in practice are substantially worse in quality than the trees inferred based on the alignment's output by an MO algorithm and 2) even high-quality alignments (according to popular measures available in the literature) may fail to achieve acceptable accuracy in generating phylogenetic trees. Thus, we essentially ask the following natural question: "can a phylogeny-aware (i.e., application-aware) metric guide in selecting appropriate MO formulations to ensure better phylogeny estimation?" Here, we report a carefully designed extensive experimental study that positively answers this question.
Muhammad Ali Nayeem, Md. Shamsuzzoha Bayzid, Atif Rahman 0001, Rifat Shahriyar, Mohammad Sohel Rahman
IEEE Trans. Cybern.3
2019 A 'phylogeny-aware' multi-objective optimization approach for computing MSA
abstract
Multiple sequence alignment (MSA) is a basic step in many analyses in bioinformatics, including predicting the structure and function of proteins, orthology prediction and estimating phylogenies. The objective of MSA is to infer the homology among the sequences of chosen species. Commonly, the MSAs are inferred by optimizing a single objective function. The alignments estimated under one criterion may be different to the alignments generated by other criteria, inferring discordant homologies and thus leading to different evolutionary histories relating the sequences. In the recent past, researchers have advocated for the multi-objective formulation of MSA, to address this issue, where multiple conflicting objective functions are being optimized simultaneously to generate a set of alignments. However, no theoretical or empirical justification with respect to a real-life application has been shown for a particular multi-objective formulation. In this study, we investigate the impact of multi-objective formulation in the context of phylogenetic tree estimation. In essence, we ask the question whether a phylogeny-aware metric can guide us in choosing appropriate multi-objective formulations. Employing evolutionary optimization, we demonstrate that trees estimated on the alignments generated by multi-objective formulation are substantially better than the trees estimated by the state-of-the-art MSA tools, including PASTA, T-Coffee, MAFFT etc.
Muhammad Ali Nayeem, Md. Shamsuzzoha Bayzid, Atif Rahman 0001, Rifat Shahriyar, Mohammad Sohel Rahman
GECCO3
2018 On Multiple Longest Common Subsequence and Common Motifs with Gaps (Extended Abstract)
Suri Dipannita Sayeed, Mohammad Sohel Rahman, Atif Rahman 0001
WALCOM3
2018 An ensemble learning based approach for impression fraud detection in mobile advertising
Ch. Md. Rakin Haider, Anindya Iqbal, Atif Rahman 0001, Mohammad Sohel Rahman
J. Netw. Comput. Appl.3