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...

Descripción completa

Detalles Bibliográficos
Autores principales: Sotiraki, Katerina, Ghosh, Esha, Chen, Hao
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2020
Materias:
Research
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

Internet

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