Cargando…
Mining Unique-m Substrings from Genomes
Unique substrings in genomes may indicate high level of specificity which is crucial and fundamental to many genetics studies, such as PCR, microarray hybridization, Southern and Northern blotting, RNA interference (RNAi), and genome (re)sequencing. However, being unique sequence in the genome alone...
Autores principales: | Ye, Kai, Jia, Zhenyu, Wang, Yipeng, Flicek, Paul, Apweiler, Rolf |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2010
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5894807/ https://www.ncbi.nlm.nih.gov/pubmed/29657484 http://dx.doi.org/10.4172/jpb.1000127 |
Ejemplares similares
-
Genome comparison without alignment using shortest unique substrings
por: Haubold, Bernhard, et al.
Publicado: (2005) -
Efficient privacy-preserving variable-length substring match for genome sequence
por: Nakagawa, Yoshiki, et al.
Publicado: (2022) -
Reference-based genome compression using the longest matched substrings with parallelization consideration
por: Lu, Zhiwen, et al.
Publicado: (2023) -
An Efficient Rank Based Approach for Closest String and Closest Substring
por: Dinu, Liviu P., et al.
Publicado: (2012) -
Simultaneous identification of long similar substrings in large sets of sequences
por: Kleffe, Jürgen, et al.
Publicado: (2007)