A computational perception of locating multiple longest common subsequence in DNA sequences

G. Tamilpavai, R. Sripathy Padhma and C. Vishnuppriya

International Journal of Intelligent Enterprise, 2020, vol. 7, issue 1/2/3, 93-106

Abstract: Bioinformatics is an active research area which combines biological matter as well as computer science research. The longest common subsequence (LCS) is one of the indispensable issue to be unravelled viably in computational science. Discovering LCS is fundamental undertaking in deoxyribonucleic acid (DNA) arrangement investigation and other molecular biology. In this paper, new calculation for discovering LCS of two DNA successions and its area is proposed. The objective of this created framework is to discover the area and length of all subsequences which introduces in the two arrangements. To achieve this, DNA sequences are stored in an array and the comparison of DNA sequences are performed using matching algorithm. At the end of matching process, group of subsequence are obtained. Then the length and location of the matched subsequence are computed. After completing the matching process, longest common subsequence(s) is located. In this proposed work, maximally obtained length of LCS is 8. Finally, the computation time is calculated for locating LCS in DNA sequences. In addition to this, computation time is analysed by gradually increasing the length (in characters count) of DNA sequences from 100, 200, 300, 400 and 500. It concludes that computation time for locating LCS in various lengths of DNA sequences took few seconds difference only.

Keywords: computational biology; deoxyribonucleic acid; DNA; longest common subsequence; LCS; matching algorithm; bioinformatics; molecular biology; NCBI; Matlab; intelligent computing. (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=104648 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijient:v:7:y:2020:i:1/2/3:p:93-106

Access Statistics for this article

More articles in International Journal of Intelligent Enterprise from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().