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...
Main Authors: | Sotiraki, Katerina, Ghosh, Esha, Chen, Hao |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Springer Science and Business Media LLC
2020
|
Online Access: | https://hdl.handle.net/1721.1/127190 |
Similar Items
-
Parallel Dynamic Maximal Matching
by: Ghaffari, Mohsen, et al.
Published: (2024) -
Maximal assortative matching for complex
by: Natarajan Meghanathan
Published: (2016-04-01) -
Finding maximal exact matches in graphs
by: Nicola Rizzo, et al.
Published: (2024-03-01) -
On Minimum Maximal Distance-k Matchings
by: Yury Kartynnik, et al.
Published: (2018-01-01) -
An Algorithm for Group Formation and Maximal Independent Set in an Amorphous Computer
by: Nagpal, Radhika, et al.
Published: (2004)