An Efficient Fast Pruned Parallel Algorithm for finding Longest Common Subsequences in BioSequences

Journal Title: Annals. Computer Science Series - Year 2010, Vol 8, Issue 1

Abstract

This paper presents an Efficient and fast approach to identify the Longest Common Subsequence between Biosequences. Identifying Longest Common Subsequence between two or more biosequences is an important problem in computer science due to its complexity and applicability to the field of biology. This Algorithm achieves its efficiency in using computational resources by doing specific pruning in the process of identifying the Longest Common Subsequence. The proposed approach has various steps like Identifying Initial Identical Character Pairs between the Sequences, its Successors, Pruning to retain potential successors and backtracking. The execution results indicate that with the proposed algorithm Memory Efficiency and Fast Execution are achieved over the prominent FAST_LCS Algorithm while retaining the precision of FAST_LCS.

Authors and Affiliations

Sumathy Eswaran, S. RajaGopalan

Keywords

Related Articles

Adaptation and Usability of Quick Response Codes for Subscription to Mobile Network Operators’ Services

Mobile Network Operators (MNOs) permit subscribers to gain access to data, voice calls or short messaging services offered by their networks. Payments for any of these services could be via online payments platforms, sho...

Prediction of Skin Disease using Decision Tree and Artificial Neural Network (ANN)

Skin diseases are common diseases that exist between the children and adults in the society. The issue of finding and proffering a better skin disease predictive model in the health care system has been identified to be...

Techniques for Securing Data Exchange between a Database Server and a Client Program<br />

The goal of the presented work is to illustrate a method by which the data exchange between a standalone computer software and a shared database server can be protected of unauthorized interception of the traffic in Inte...

An In-depth Study of Typical Machine Learning Methods via Computational Techniques

The ability to model and perform decision modeling and analysis is an essential feature of many real-world applications ranging from emergency medical treatment in intensive care units to military command and control sys...

Analytic Approach To Face Emotion Recognition With SVM Kernels

Face emotion recognition is one of the challenges known with emotion recognition and it has received much attention during the recent years due to its application in different fields. SVM kernels were adopted to increase...

Download PDF file
  • EP ID EP144751
  • DOI -
  • Views 99
  • Downloads 0

How To Cite

Sumathy Eswaran, S. RajaGopalan (2010). An Efficient Fast Pruned Parallel Algorithm for finding Longest Common Subsequences in BioSequences. Annals. Computer Science Series, 8(1), 137-150. https://www.europub.co.uk/articles/-A-144751