Cargando…
microTaboo: a general and practical solution to the k-disjoint problem
BACKGROUND: A common challenge in bioinformatics is to identify short sub-sequences that are unique in a set of genomes or reference sequences, which can efficiently be achieved by k-mer (k consecutive nucleotides) counting. However, there are several areas that would benefit from a more stringent d...
Autores principales: | Al-Jaff, Mohammed, Sandström, Eric, Grabherr, Manfred |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5414201/ https://www.ncbi.nlm.nih.gov/pubmed/28464826 http://dx.doi.org/10.1186/s12859-017-1644-6 |
Ejemplares similares
-
The Edge-Disjoint Path Problem on Random Graphs by Message-Passing
por: Altarelli, Fabrizio, et al.
Publicado: (2015) -
Inverses of disjointness preving operators
por: Abramovich, YA, et al.
Publicado: (1999) -
PiiL: visualization of DNA methylation and gene expression data in gene pathways
por: Moghadam, Behrooz Torabi, et al.
Publicado: (2017) -
Qxpak.5: Old mixed model solutions for new genomics problems
por: Pérez-Enciso, Miguel, et al.
Publicado: (2011) -
ACES: a machine learning toolbox for clustering analysis and visualization
por: Gao, Jiangning, et al.
Publicado: (2018)