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
- EP ID EP144751
- DOI -
- Views 81
- Downloads 0
Performance Evaluation of Implementation Languages on Cognitive Complexity of Dijkstra Algorithm
Maintainability is a key factor in measuring the quality of developed software and it becomes important due to dynamism of software. Partially, maintainability is a function of source code understandability on the part o...
Reduction of enhanced maintenance effort using ARM model and RMMM plan
Software maintenance effort is playing a very important role for the development of the software. In maintenance phase user request for change and effort required for the maintenance of software is more as compare to the...
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...
Kerberos Authentication in Wireless Sensor Networks
We proposed an authentication mechanism in the wireless sensor network. Sensor network uses the Kerberos authentication scheme for the authentication of bases station in the network. Kerberos provides a centralized authe...
Network Traffic and Utilization: Reliability of Network Analyzer Development with Independent Data, OPNET Simulation Tool and Real Network
This paper presents a complete network analyzer development for heterogeneous services in campus environment. The purpose of this study is to define the accuracy of network analyzer development with independent data, rea...