Parallel DNA Sequence Approximate Matching with Multi-Length Sequence Aware Approach | Zendy

Hadeel Alazzam | Zendy; Ahmad Sharieh | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Parallel DNA Sequence Approximate Matching with Multi-Length Sequence Aware Approach

Author(s) -

Hadeel Alazzam,

Ahmad Sharieh

Publication year - 2018

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/ijca2018916594

Subject(s) - computer science , sequence (biology) , matching (statistics) , dna sequencing , dna , genetics , statistics , biology , mathematics

DNA sequence approximate matching is one of the main challenges in Bioinformatics. Despite the evolution of new technology, there is still a need for new algorithms that accommodate the huge amount of Bioinformatics data. In this paper, a parallel n-gram approach is proposed with a method that is taking in mind the variety of DNA sequence lengths for approximate matching. The proposed approach showed a satisfiability result in terms of time complexity compared to parallel dynamic programming method.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research