Cargando…
rasbhari: Optimizing Spaced Seeds for Database Searching, Read Mapping and Alignment-Free Sequence Comparison
Many algorithms for sequence analysis rely on word matching or word statistics. Often, these approaches can be improved if binary patterns representing match and don’t-care positions are used as a filter, such that only those positions of words are considered that correspond to the match positions o...
Autores principales: | Hahn, Lars, Leimeister, Chris-André, Ounit, Rachid, Lonardi, Stefano, Morgenstern, Burkhard |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Public Library of Science
2016
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5070788/ https://www.ncbi.nlm.nih.gov/pubmed/27760124 http://dx.doi.org/10.1371/journal.pcbi.1005107 |
Ejemplares similares
-
Accurate multiple alignment of distantly related genome sequences using filtered spaced word matches as anchor points
por: Leimeister, Chris-André, et al.
Publicado: (2019) -
Fast alignment-free sequence comparison using spaced-word frequencies
por: Leimeister, Chris-Andre, et al.
Publicado: (2014) -
Read-SpaM: assembly-free and alignment-free comparison of bacterial genomes with low sequencing coverage
por: Lau, Anna-Katharina, et al.
Publicado: (2019) -
kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison
por: Leimeister, Chris-Andre, et al.
Publicado: (2014) -
Spaced words and kmacs: fast alignment-free sequence comparison based on inexact word matches
por: Horwege, Sebastian, et al.
Publicado: (2014)