Machbah Uddin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Machbah Uddin has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Rakib Hassan
Department of Computer Science and Mathematics, Bangladesh Agricultural University, Mymensingh, Bangladesh
12 shared publications - Mohammad Khairul Islam
Department of Computer Science and Engineering, University of Chittagong, Chittagong, Bangladesh
5 shared publications - Farah Jahan
Department of Computer Science and Engineering, University of Chittagong, Chittagong, Bangladesh
4 shared publications - Sayeed Iftekhar Yousuf
Department of Computer Science and Mathematics, Bangladesh Agricultural University, Mymensingh, Bangladesh
4 shared publications Arif Hasan Khan Robin
Affiliation Department of Genetics and Plant Breeding, Bangladesh Agricultural University, Mymensingh, Bangladesh
2 shared publicationsAysha Siddika Ratna
Department of Physical Medicine and Rehabilitation, Mymensingh Medical College Hospital, Mymensingh, Bangladesh
2 shared publications
Latest Publications
- Open Access
- 10 August 2026
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 21 (8) , e0348861
ProteoMapper: Alignment-aware identification and quantitative analysis of contextual motif–domain patterns in protein families
Understanding how sequence patterns relate to conserved protein domains is fundamental for interpreting protein function and organization. Although numerous tools support motif detection and domain annotation, assessing their positional relationships across multiple sequence alignments typically requires combining outputs from separate analyses. Here, we present ProteoMapper , a Python-based toolkit for alignment-aware annotation and visualization of protein sequences. The framework integrates user-defined regular expression–based motif detection with HMMER-based domain annotation using Pfam profiles, and maps both features directly onto aligned sequences within a unified system. Results are exported as a multi-sheet spreadsheet with standardized visual annotations, enabling simultaneous inspection of motif occurrences, domain regions, and positional patterns across homologous proteins. ProteoMapper additionally computes a motif–domain coverage score (MDCS), defined as the fraction of motif residues overlapping annotated domains. This metric provides a descriptive measure of motif localization relative to domain regions and supports differentiation between domain-associated sequence signatures and motifs occurring outside annotated domains. To complement this, the tool reports positional conservation of motifs across alignments, facilitating identification of positionally constrained sequence patterns. The utility of ProteoMapper is demonstrated through case studies including validation of domain detection against published datasets, analysis of conserved sequence signatures in ERD6-like sugar transporter proteins, and evaluation of regulatory motif localization in HIF-1 α sequences. ProteoMapper provides an integrated and accessible framework for visualization and basic quantification of motif and domain annotations within an alignment context, supporting exploratory analysis of protein sequence organization. Source code, documentation, and datasets are available at https://github.com/sifullah0/ProteoMapper .
- 10 August 2026
- Published by Public Library of Science (PLoS) in PLOS ONE
- Vol. 21 (8) , e0348861
Open AccessProteoMapper: Alignment-aware identification and quantitative analysis of contextual motif–domain patterns in protein families
Understanding how sequence patterns relate to conserved protein domains is fundamental for interpreting protein function and organization. Although numerous tools support motif detection and domain annotation, assessing their positional relationships across multiple sequence alignments typically requires combining outputs from separate analyses. Here, we present ProteoMapper , a Python-based toolkit for alignment-aware annotation and visualization of protein sequences. The framework integrates user-defined regular expression–based motif detection with HMMER-based domain annotation using Pfam profiles, and maps both features directly onto aligned sequences within a unified system. Results are exported as a multi-sheet spreadsheet with standardized visual annotations, enabling simultaneous inspection of motif occurrences, domain regions, and positional patterns across homologous proteins. ProteoMapper additionally computes a motif–domain coverage score (MDCS), defined as the fraction of motif residues overlapping annotated domains. This metric provides a descriptive measure of motif localization relative to domain regions and supports differentiation between domain-associated sequence signatures and motifs occurring outside annotated domains. To complement this, the tool reports positional conservation of motifs across alignments, facilitating identification of positionally constrained sequence patterns. The utility of ProteoMapper is demonstrated through case studies including validation of domain detection against published datasets, analysis of conserved sequence signatures in ERD6-like sugar transporter proteins, and evaluation of regulatory motif localization in HIF-1 α sequences. ProteoMapper provides an integrated and accessible framework for visualization and basic quantification of motif and domain annotations within an alignment context, supporting exploratory analysis of protein sequence organization. Source code, documentation, and datasets are available at https://github.com/sifullah0/ProteoMapper .
- 24 April 2026
- Published by Springer Nature in Molecular Genetics and Genomics
- Vol. 301 (1) , 102
A novel dynamic part-wise direct and complementary template matching approach for DNA sequence similarity identification
- 24 April 2026
- Published by Springer Nature in Molecular Genetics and Genomics
- Vol. 301 (1) , 102
A novel dynamic part-wise direct and complementary template matching approach for DNA sequence similarity identification
- Open Access
ProteoMapper: Alignment-Aware Identification and Quantitative Analysis of Contextual Motif–Domain Patterns in Protein Families
Protein function depends on interactions between structural domains and regulatory motifs. Yet current tools analyze these elements separately, hindering investigation of disease mutations affecting evolutionarily conserved, structurally constrained motifs. We present ProteoMapper, a computational framework integrating HMMER-based domain annotation with user-defined motif detection to quantify motif-domain spatial relationships in protein families. ProteoMapper introduces two discovery metrics: (1) positional conservation scoring, identifying motifs at identical alignment coordinates in ≥ N % of sequences (default 60%), indicating purifying selection; (2) Motif-Domain Coverage Score (MDCS), quantifying motif embedding within Pfam domains (MDCS=1: fully embedded; MDCS=0: extra-domain). The platform processes Excel-formatted alignments without programming requirements, delivering color-coded reports with conserved motif positions, domain boundaries, and MDCS values. Parallel execution of sequence batches enables rapid analysis (8 motifs were searched in 150 sequences with complete Pfam scanning in 93% positional concordance. ProteoMapper enables hypothesis-driven investigation of evolutionary constraints, regulatory mechanisms, and variant effect prediction in biomedical and functional proteomics. Source code, documentation, and test results with datasets at https://github.com/sifullah0/ProteoMapper .
Open AccessProteoMapper: Alignment-Aware Identification and Quantitative Analysis of Contextual Motif–Domain Patterns in Protein Families
Protein function depends on interactions between structural domains and regulatory motifs. Yet current tools analyze these elements separately, hindering investigation of disease mutations affecting evolutionarily conserved, structurally constrained motifs. We present ProteoMapper, a computational framework integrating HMMER-based domain annotation with user-defined motif detection to quantify motif-domain spatial relationships in protein families. ProteoMapper introduces two discovery metrics: (1) positional conservation scoring, identifying motifs at identical alignment coordinates in ≥ N % of sequences (default 60%), indicating purifying selection; (2) Motif-Domain Coverage Score (MDCS), quantifying motif embedding within Pfam domains (MDCS=1: fully embedded; MDCS=0: extra-domain). The platform processes Excel-formatted alignments without programming requirements, delivering color-coded reports with conserved motif positions, domain boundaries, and MDCS values. Parallel execution of sequence batches enables rapid analysis (8 motifs were searched in 150 sequences with complete Pfam scanning in 93% positional concordance. ProteoMapper enables hypothesis-driven investigation of evolutionary constraints, regulatory mechanisms, and variant effect prediction in biomedical and functional proteomics. Source code, documentation, and test results with datasets at https://github.com/sifullah0/ProteoMapper .
- Open Access
- 11 February 2026
- Published by Elsevier in SSRN Electronic Journal
Layered GraphQL:Declarative load balancing for frontend
Context: GraphQL APIs retrieve complete data structures in mono-lithic requests, causing performance degradation that is particularly problematicin low-bandwidth networks or resource-constrained devices.Objectives: To enable progressive, field-level data fetching in GraphQL that re-duces initial payload size and accelerates user interface responsiveness withoutcompromising data completeness.Methods: We propose Layered GraphQL, a novel approach using custom direc-tives (@layer(level: n)) to annotate query fields with priority levels. A representa proof-of-concept hook in React (useLayeredQuery) to incrementally executes lay-ered queries and merges partial results via a custom deep merge strategy, enablingprogressive UI hydration.Results: Comparative analysis demonstrates substantial reductions in frontendpayload sizes and rendering delays versus traditional monolithic queries. The ap-proach improves time-to-interaction and network efficiency, with the particularbenefit that it requires no server-side migration.Conclusion: Layered GraphQL provides a practical mechanism for progressivedata delivery that enhances application responsiveness in constrained environ-ments while maintaining GraphQL’s flexibility. The technique is compatible withexisting GraphQL ecosystems and offers measurable performance improvementsfor data-intensive applications.The code is available at https://github.com/maifeeulasad/layered-graphql(will be made public after acceptance), till then code is available at https://drive.google.com/drive/folders/1-2sx-bVVpjC5f1zGmbi6XsSeL0MV0XzB?usp=sharing.
- 11 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessLayered GraphQL:Declarative load balancing for frontend
Context: GraphQL APIs retrieve complete data structures in mono-lithic requests, causing performance degradation that is particularly problematicin low-bandwidth networks or resource-constrained devices.Objectives: To enable progressive, field-level data fetching in GraphQL that re-duces initial payload size and accelerates user interface responsiveness withoutcompromising data completeness.Methods: We propose Layered GraphQL, a novel approach using custom direc-tives (@layer(level: n)) to annotate query fields with priority levels. A representa proof-of-concept hook in React (useLayeredQuery) to incrementally executes lay-ered queries and merges partial results via a custom deep merge strategy, enablingprogressive UI hydration.Results: Comparative analysis demonstrates substantial reductions in frontendpayload sizes and rendering delays versus traditional monolithic queries. The ap-proach improves time-to-interaction and network efficiency, with the particularbenefit that it requires no server-side migration.Conclusion: Layered GraphQL provides a practical mechanism for progressivedata delivery that enhances application responsiveness in constrained environ-ments while maintaining GraphQL’s flexibility. The technique is compatible withexisting GraphQL ecosystems and offers measurable performance improvementsfor data-intensive applications.The code is available at https://github.com/maifeeulasad/layered-graphql(will be made public after acceptance), till then code is available at https://drive.google.com/drive/folders/1-2sx-bVVpjC5f1zGmbi6XsSeL0MV0XzB?usp=sharing.
- Open Access
- 25 October 2025
- Published by Elsevier in Smart Agricultural Technology
- Vol. 12
Handcrafted feature-based poultry disease detection from fecal images
- 25 October 2025
- Published by Elsevier in Smart Agricultural Technology
- Vol. 12
Open AccessHandcrafted feature-based poultry disease detection from fecal images
- Open Access
- 3 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 156188-156202
Phylogeny Reconstruction Using Multi-Agent Surface Area Pressure Features
Phylogenetic analysis of species is essential for understanding the various biological activities of an organism, including gene editing, drug design, and vaccine development. Traditional alignment-based (AB) methods, however, face significant computational challenges, becoming NP-hard when applied to large or medium-sized sequences. As a result, alignment-free (AF) approaches have gained attraction. Despite their growing popularity, AF methods struggle to optimize the critical aspects of computational time, accuracy, and memory usage. Due to the time inefficiency of AF approaches, significant man-hours are wasted in laboratories. Consequently, different studies have employed statistical approaches on entire sequences; however, these are less efficient because they lose positional information, for which relative information-based approaches, including entropy and joint probability, have achieved higher performance. However, entropy-based methods are not highly sensitive to small changes in DNA sequences. In response to these limitations, a novel multi-agent surface area pressure (MASAP) feature-based method is proposed, which is highly sensitive and efficient in representing the relative information of a DNA sequence. First, it selects the length of the k-mer and constructs a 2D list for the positional information of k-mers, where each row corresponds to a specific k-mer. Subsequently, the positional data is converted into relative data from which the MASAP feature is derived, and this is used for feature descriptor generation and phylogenetic tree reconstruction. Extensive experiments were carried out on benchmark datasets, and the proposed MASAP method consistently achieved top-ranked accuracy across all datasets. Furthermore, in terms of computational time, MASAP significantly outperforms existing methods, being 5, 151 to 8, 162 times faster than the MEGA tool. The source code and datasets are available at https://github.com/machbah/MASP.
- 3 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 156188-156202
Open AccessPhylogeny Reconstruction Using Multi-Agent Surface Area Pressure Features
Phylogenetic analysis of species is essential for understanding the various biological activities of an organism, including gene editing, drug design, and vaccine development. Traditional alignment-based (AB) methods, however, face significant computational challenges, becoming NP-hard when applied to large or medium-sized sequences. As a result, alignment-free (AF) approaches have gained attraction. Despite their growing popularity, AF methods struggle to optimize the critical aspects of computational time, accuracy, and memory usage. Due to the time inefficiency of AF approaches, significant man-hours are wasted in laboratories. Consequently, different studies have employed statistical approaches on entire sequences; however, these are less efficient because they lose positional information, for which relative information-based approaches, including entropy and joint probability, have achieved higher performance. However, entropy-based methods are not highly sensitive to small changes in DNA sequences. In response to these limitations, a novel multi-agent surface area pressure (MASAP) feature-based method is proposed, which is highly sensitive and efficient in representing the relative information of a DNA sequence. First, it selects the length of the k-mer and constructs a 2D list for the positional information of k-mers, where each row corresponds to a specific k-mer. Subsequently, the positional data is converted into relative data from which the MASAP feature is derived, and this is used for feature descriptor generation and phylogenetic tree reconstruction. Extensive experiments were carried out on benchmark datasets, and the proposed MASAP method consistently achieved top-ranked accuracy across all datasets. Furthermore, in terms of computational time, MASAP significantly outperforms existing methods, being 5, 151 to 8, 162 times faster than the MEGA tool. The source code and datasets are available at https://github.com/machbah/MASP.
- 25 July 2025
- Published by Springer Nature
- p. 585-598
A Deep Learning Approach to Detect Adulterated Milled Rice Kernels of Bangladeshi Varieties
- 25 July 2025
- Published by Springer Nature
- p. 585-598
A Deep Learning Approach to Detect Adulterated Milled Rice Kernels of Bangladeshi Varieties
- Open Access
- 17 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 917-924
Tomato stem scar detection using C3Ghost-based improved YOLOv5 model
- 17 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 917-924
Open AccessTomato stem scar detection using C3Ghost-based improved YOLOv5 model
- 17 October 2024
- Published by Springer Nature
- p. 149-167
Pseudo-Knighted Cocktail Shaker Sort