Solving Fragment Assembly Problem using hybrid 2-Stage Algorithm

UIU Institutional Repository

    • Login
    View Item 
    •   UIU DSpace Home
    • School of Science and Engineering (SoSE)
    • Department of Computer Science and Engineering (CSE)
    • B.Sc Thesis/Project
    • View Item
    •   UIU DSpace Home
    • School of Science and Engineering (SoSE)
    • Department of Computer Science and Engineering (CSE)
    • B.Sc Thesis/Project
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Solving Fragment Assembly Problem using hybrid 2-Stage Algorithm

    Thumbnail
    View/Open
    Thesis Template (2).pdf (1.801Mb)
    Date
    2019-07
    Author
    Mohammad, Aziz
    Al-Hasan, Md.
    Rahman, Md. Arifur
    Hossain, Md. Shakhaeat
    Metadata
    Show full item record
    Abstract
    Deoxyribonucleic acid (DNA) is the carrier of the hereditary characteristics of an organism. It also holds promise for predicting fatal diseases. These predictions are essential as they enable prevention rather than cure. However, such detection techniques would be improbable without comprehending the complete genome of an organism. Through our work we tried to unravel the genome code by assembling DNA fragments using our 2-stage hybrid algorithm which employs Ant Colony Optimization and deft Local Search technique to maximize the DNA fragment overlap count.
    URI
    http://dspace.uiu.ac.bd/handle/52243/1215
    Collections
    • B.Sc Thesis/Project [82]

    Copyright 2003-2017 United International University
    Contact Us | Send Feedback
    Developed by UIU CITS
     

     

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Copyright 2003-2017 United International University
    Contact Us | Send Feedback
    Developed by UIU CITS