Privately computing set-maximal matches in genomic data
Abstract 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 natu...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Published: |
BMC,
2020-07-01T00:00:00Z.
|
| Subjects: | |
| Online Access: | Connect to this object online. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|