Cargando…
Efficient privacy-preserving variable-length substring match for genome sequence
The development of a privacy-preserving technology is important for accelerating genome data sharing. This study proposes an algorithm that securely searches a variable-length substring match between a query and a database sequence. Our concept hinges on a technique that efficiently applies FM-index...
Autores principales: | Nakagawa, Yoshiki, Ohata, Satsuya, Shimizu, Kana |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2022
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9040336/ https://www.ncbi.nlm.nih.gov/pubmed/35473587 http://dx.doi.org/10.1186/s13015-022-00211-1 |
Ejemplares similares
-
Efficient privacy-preserving string search and an application in genomics
por: Shimizu, Kana, et al.
Publicado: (2016) -
Phylogenetic Analysis of Protein Sequences Based on Distribution of Length About Common Substring
por: Chang, Guisong, et al.
Publicado: (2011) -
Reference-based genome compression using the longest matched substrings with parallelization consideration
por: Lu, Zhiwen, et al.
Publicado: (2023) -
Mining Unique-m Substrings from Genomes
por: Ye, Kai, et al.
Publicado: (2010) -
Phylogeny reconstruction based on the length distribution of k-mismatch common substrings
por: Morgenstern, Burkhard, et al.
Publicado: (2017)