Cargando…
Minimally overlapping words for sequence similarity search
MOTIVATION: Analysis of genetic sequences is usually based on finding similar parts of sequences, e.g. DNA reads and/or genomes. For big data, this is typically done via ‘seeds’: simple similarities (e.g. exact matches) that can be found quickly. For huge data, sparse seeding is useful, where we onl...
Autores principales: | Frith, Martin C, Noé, Laurent, Kucherov, Gregory |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Oxford University Press
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8016470/ https://www.ncbi.nlm.nih.gov/pubmed/33346833 http://dx.doi.org/10.1093/bioinformatics/btaa1054 |
Ejemplares similares
-
YASS: enhancing the sensitivity of DNA similarity search
por: Noé, Laurent, et al.
Publicado: (2005) -
Optimal neighborhood indexing for protein similarity search
por: Peterlongo, Pierre, et al.
Publicado: (2008) -
Estimation of pairwise sequence similarity of mammalian enhancers with word neighbourhood counts
por: Göke, Jonathan, et al.
Publicado: (2012) -
Improved hit criteria for DNA local alignment
por: Noé, Laurent, et al.
Publicado: (2004) -
Improved search heuristics find 20 000 new alignments between human and mouse genomes
por: Frith, Martin C., et al.
Publicado: (2014)