• Libraries
    • Log in to:
    View Item 
    •   MSpace Home
    • University of Manitoba Researchers
    • University of Manitoba Scholarship
    • View Item
    •   MSpace Home
    • University of Manitoba Researchers
    • University of Manitoba Scholarship
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Parallel and private generalized suffix tree construction and query on genomic data

    Thumbnail
    View/Open
    12863_2022_Article_1053.pdf (1.620Mb)
    Date
    2022-06-17
    Author
    Al Aziz, Md M.
    Thulasiraman, Parimala
    Mohammed, Noman
    Metadata
    Show full item record
    Abstract
    Abstract Background Several technological advancements and digitization of healthcare data have provided the scientific community with a large quantity of genomic data. Such datasets facilitated a deeper understanding of several diseases and our health in general. Strikingly, these genome datasets require a large storage volume and present technical challenges in retrieving meaningful information. Furthermore, the privacy aspects of genomic data limit access and often hinder timely scientific discovery. Methods In this paper, we utilize the Generalized Suffix Tree (GST); their construction and applications have been fairly studied in related areas. The main contribution of this article is the proposal of a privacy-preserving string query execution framework using GSTs and an additional tree-based hashing mechanism. Initially, we start by introducing an efficient GST construction in parallel that is scalable for a large genomic dataset. The secure indexing scheme allows the genomic data in a GST to be outsourced to an untrusted cloud server under encryption. Additionally, the proposed methods can perform several string search operations (i.e., exact, set-maximal matches) securely and efficiently using the outlined framework. Results The experimental results on different datasets and parameters in a real cloud environment exhibit the scalability of these methods as they also outperform the state-of-the-art method based on Burrows-Wheeler Transformation (BWT). The proposed method only takes around 36.7s to execute a set-maximal match whereas the BWT-based method takes around 160.85s, providing a 4× speedup.
    URI
    https://doi.org/10.1186/s12863-022-01053-x
    http://hdl.handle.net/1993/36585
    Collections
    • Faculty of Science Scholarly Works [209]
    • University of Manitoba Scholarship [1981]

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     

    Browse

    All of MSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    Statistics

    View Usage Statistics

    DSpace software copyright © 2002-2016  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    Atmire NV