Cargando…
Alignment-free comparison of metagenomics sequences via approximate string matching
SUMMARY: 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 p...
Autores principales: | Chen, Jian, Yang, Le, Li, Lu, Goodison, Steve, Sun, Yijun |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9645238/ https://www.ncbi.nlm.nih.gov/pubmed/36388153 http://dx.doi.org/10.1093/bioadv/vbac077 |
Ejemplares similares
-
Fast algorithms for approximate circular string matching
por: Barton, Carl, et al.
Publicado: (2014) -
Complexity Issues of String to Graph Approximate Matching
por: Dondi, Riccardo, et al.
Publicado: (2020) -
Improved algorithms for approximate string matching (extended abstract)
por: Papamichail, Dimitris, et al.
Publicado: (2009) -
Reads Binning Improves Alignment-Free Metagenome Comparison
por: Song, Kai, et al.
Publicado: (2019) -
Fast randomized approximate string matching with succinct hash data structures
por: Policriti, Alberto, et al.
Publicado: (2015)