Cargando…
Privately computing set-maximal matches in genomic data
BACKGROUND: Finding long matches in deoxyribonucleic acid (DNA) sequences in large aligned genetic sequences is a problem of great interest. A paradigmatic application is the identification of distant relatives via large common subsequences in DNA data. However, because of the sensitive nature of ge...
Autores principales: | Sotiraki, Katerina, Ghosh, Esha, Chen, Hao |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7372803/ https://www.ncbi.nlm.nih.gov/pubmed/32693838 http://dx.doi.org/10.1186/s12920-020-0718-x |
Ejemplares similares
-
Data-Driven Engineering of Social Dynamics: Pattern Matching and Profit Maximization
por: Peng, Huan-Kai, et al.
Publicado: (2016) -
Private queries on encrypted genomic data
por: Çetin, Gizem S., et al.
Publicado: (2017) -
Matching Behavior as a Tradeoff Between Reward Maximization and Demands on Neural Computation
por: Kubanek, Jan, et al.
Publicado: (2015) -
When Does Reward Maximization Lead to Matching Law?
por: Sakai, Yutaka, et al.
Publicado: (2008) -
Maximizing ecological and evolutionary insight in bisulfite sequencing data sets
por: Lea, Amanda J., et al.
Publicado: (2017)