Sign in
BioinformaticsBioinformatics Advances
Peer-reviewed journal article

Alignment-free Comparison of Metagenomics Sequences via Approximate String Matching

Jian CheniD, Le YangiD, Lu LiiD, Steve Goodison BiD, Yijun SuniD

Abstract

Quantifying pairwise sequence similarities is a key step in metagenomics studies. Alignment-free methods provide a computationally efficient alternative to alignment-based methods for large-scale sequence analysis. Several neural network-based methods have recently been developed for this purpose. However, existing methods do not perform well on sequences of varying lengths and are sensitive to the presence of insertions and deletions. In this paper, we describe the development of a new method, referred to as AsMac, that addresses the aforementioned issues. We proposed a novel neural network structure for approximate string matching for the extraction of pertinent information from biological sequences and developed an efficient gradient computation algorithm for training the constructed neural network. We performed a large-scale benchmark study using real-world data that demonstrated the effectiveness and potential utility of the proposed method. The open-source software for the proposed method and trained neural-network models for some commonly used metagenomics marker genes were developed and are freely available at www.acsu.buffalo.edu/~yijunsun/lab/AsMac.html.

PDFDOI

02 /Specification & Classification

Click any tag to browse matching papers
Citations
9
FWCI
0.24
Field percentile
42th percentile

Reproducibility ledger

Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.

Sign in to file a reproducibility report.

Similarity Map
SelectedSame fieldCross-field
THISLaPierre '20Lu '21Akhter '16Shaw '23Saha '20Zieleziński '19
56% semantic matchBioinformatics
Nathan LaPierre, Mohammed Alser, Eleazar Eskin+2 more·Genome biology·Sep 10, 2020· 71 citations