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

Image Fusion and Re-Modified SPIHT for Fused Image

This paper presents the Discrete Wavelet based fusion techniques for combining perceptually important image features. SPIHT (Set Partitioning in Hierarchical Trees) algorithm is an efficient method for lossy and lossless...

Diagonalization Matrix Method of Solving the First Basic Problem of Hidden Markov Model in Speech Recognition System

This paper proposes a computationally efficient method of solving evaluation problem of Hidden Markov Model (HMM) with a given set of discrete observation symbols, number of states and probability distribution matrices....

Variable Selection in the Modeling of Nigeria Economic Growth

This study aimed at identifying and retaining factors that contributed immensely to economic growth in Nigeria based on some variable selection methods. Stepwise regressions are often not efficient when there is multicol...

Usuability Evaluation Of Twitter Micro-Blog Using Heuristic Approach

The innovations that accompany the introduction of social media as a tool of communication have really set a pace at which several activities are carried out. The social network has attracted so many users across the wor...

Computer applications in clinical psychology

The computer-assisted analysis is not currently a novelty, but a necessity in all areas of psychology. A number of studies that examine the limits of the computer assisted and analyzed interpretations, also its advantage...

Download PDF file
  • EP ID EP144751
  • DOI -
  • Views 74
  • 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://europub.co.uk/articles/-A-144751