Search bioRxiv⌕ Search
Home/Archive/bioRxiv

bioRxiv · 10.1101/569970

MetaMLP: A fast word embedding based classifier to profile target gene databases in metagenomic samples

Arango-Argoty, G. A.·Heath, L. S.·Pruden, A.·Vikesland, P.·Zhang, L.
View original source ↗Export metadata ↓

Abstract

The functional profile of metagenomic samples allows the understanding of the role of the microbes in their environment. Such analysis consists of assigning short sequencing reads to a particular functional category. Normally, manually curated databases are used for functional assignment where genes are arranged into different classes. Sequence alignment has been widely used to profile metagenomic samples against curated databases. However, this method is time consuming and requires high computing resources. Although several alignment free methods based on k-mer composition have been developed in the recent years, they still require a large amount of memory. In this paper, MetaMLP (Metagenomics Machine Learning Profiler) a machine learning method that represents sequences into numerical vectors (embeddings) and uses a simple one hidden layer neural network to profile functional categories is proposed. Unlike other methods, MetaMLP enables partial matching by using a reduced alphabet to build sequence embeddings from full and partial kmers. MetaMLP is able to identify a slightly larger number of reads compared to Diamond (one of the fastest sequence alignment method) as well as to perform accurate predictions with 0.99 precision and 0.99 recall. MetaMLP can process 100M reads in around 10 minutes in a laptop computer which is 50x faster than Diamond. MetaMLP is free for use, available at https://bitbucket.org/gaarangoa/metamlp/src/master/.

Source connections

Explore related subjects

bioinformaticsPreprint

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arango-Argoty, G. A., Heath, L. S., Pruden, A., Vikesland, P., Zhang, L.. 2019-03-06. MetaMLP: A fast word embedding based classifier to profile target gene databases in metagenomic samples. https://doi.org/10.1101/569970

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related preprints

bioRxiv2026

From Screening to Differential Diagnosis: Benchmarking 3D Facial Representations Across Craniofacial Conditions

Rare genetic disorders often present with highly heterogeneous physical features: some have distinctive craniofacial characteristics, whereas others produce subtler or more variable facial differences, making phenotype-based diagnosis challenging. Three-dimensional (3D) facial scanning is a noninvasive approach that captures facial shape and surface geometry, providing quantitative information on craniofacial morphology beyond conventional 2D photographs. Here, we investigated how well 3D facial representations support clinical tasks ranging from broad screening to fine-grained differential diagnosis without landmark registration, dense correspondence, or template fitting. We benchmarked four 3D models, including PointNet, PointNet++, DGCNN, and a geometric baseline, using 26,990 facial scans from 18,785 subjects across four prediction tasks. Across models, performance declined as greater diagnostic specificity was required. Broad affected-versus-unaffected screening achieved high performance (accuracy 0.893; AUC 0.956), although sensitivity analyses revealed substantial influences of cohort composition and demographic differences. Fine-grained syndrome diagnosis remained more challenging, with limited top-1 accuracy despite meaningful class-wise discrimination. Combining repeated scans improved patient-level diagnosis beyond differences in patient weighting. Prototype inference further improved diagnostic prioritization, placing the correct syndrome among the top five candidates for about 65\% of held-out patients across 49 diagnoses. Patient-to-patient retrieval identified phenotypically similar confirmed cases, while useful syndrome prototypes could be constructed from relatively few reference patients. Anatomical region-occlusion analysis revealed syndrome-dependent patterns of facial importance broadly consistent with clinically recognized craniofacial features, although overlapping facial phenotypes contributed to diagnostic confusion. Overall, these findings support the potential of 3D facial representations for diagnostic candidate prioritization and retrieval, while emphasizing the influence of cohort composition on screening performance and the challenges of distinguishing phenotypically similar genetic syndromes.

bioinformatics↗
bioRxiv2026

Algorithms for Designing Therapeutic Oligonucleotides on Pangenome Graphs

Designing therapeutic oligonucleotides that act reliably across human genetic diversity requires more than alignment to a single reference genome. Binding affinity of an siRNA or ASO to a usually complementary site in an mRNA target molecule is one main determinant of drug efficacy. Thus, variation in sub-populations can lead to failures in drug development if this variation reduces binding affinity. We provide a first methodological step towards principled, variant-aware design of therapeutic oligonucleotides. The genetic diversity in target genes, or specific regions thereof, is represented as a pangenome graph. We define individual or small sets of suitable therapeutic oligonucleotides by their ability to cover all paths in a directed acyclic graph within a bounded edit distance <= k. Edit distance is used as an accepted proxy to the commonly used binding affinity. We formalize the resulting computational problem and provide complexity results: NP-hardness of identifying such minimal sets even for k =0, and coNP-completeness of verifying the validity of a given set of oligonucleotides. Further, we propose algorithmic approaches operating on a product graph of an automaton (an Aho-Corasick DFA or an Ukkonen DFA) and the pangenome graph, as well as a dynamic programming-based lossless filter. We evaluate the approaches on gene-specific subgraphs of human pangenome graphs and demonstrate favorable performance compared to naive brute-force computation. Our results show that candidate target sites with a threshold of k <= 3 can be identified even for large, complex graphs where the brute-force computation did not complete within 24h. We observe that the dynamic programming-based lossless filter outperforms both product-graph approaches as well as brute-force baselines while maintaining an average approximation ratio < 1.5 across more than a hundred evaluated subgraphs. We also present examples where a small set of oligonucleotides constitutes a feasible solution where no single oligonucleotide with a threshold of k <= 2 covers all paths.

bioinformatics↗
bioRxiv2026

Evolutionarily Conserved Fragments reveal modular architecture and expand functional coverage in bacteriophage proteins

Bacteriophage proteins evolve through extensive modular exchange, yet the sequence units underlying this process remain poorly defined. Classical domains are plausible evolutionary modules, but they incompletely annotate phage proteins and may not always coincide with the regions conserved across protein families. Here, we constructed 13,035 Evolutionarily Conserved Fragments (ECFs), grouped into 3,167 families, through large-scale HMM-HMM comparisons of proteins from 5,396 RefSeq phage genomes, without imposing predefined domain boundaries. ECFs overlapped substantially with ECOD and Pfam annotations but formed a heterogeneous spectrum comprising subdomains, domain-equivalent units, composite regions and fragments with no counterpart in either resource. Their relationships were frequently nested, indicating that conserved modules occur at multiple organisational scales. ECFs annotated 50% of phage representative proteins (at least doubling the coverage of either database), with the largest gains in structural and infection-related functions, a pattern replicated in independent metagenomic data. ECF families also showed function-dependent patterns of diversity and spatial segregation and provided functional associations for 23,925 protein families lacking detectable Pfam or ECOD domains. In receptor-binding proteins, ECFs subdivided established domains, delineated previously unannotated structural elements and recovered homologous regions where structural similarity was ambiguous. These results show that the evolutionary building blocks of phage proteins do not always coincide with classical domains, highlighting that evolutionary processes act across multiple scales. ECFs provide a complementary, sequence-derived framework for investigating how complex viral proteins are assembled, diversified and functionally organised.

bioinformatics↗