IDEAS home Printed from https://ideas.repec.org/a/ids/ijient/v7y2020i1-2-3p93-106.html
   My bibliography  Save this article

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

Author

Listed:
  • G. Tamilpavai
  • R. Sripathy Padhma
  • C. Vishnuppriya

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.

Suggested Citation

  • G. Tamilpavai & R. Sripathy Padhma & C. Vishnuppriya, 2020. "A computational perception of locating multiple longest common subsequence in DNA sequences," International Journal of Intelligent Enterprise, Inderscience Enterprises Ltd, vol. 7(1/2/3), pages 93-106.
    • Handle: RePEc:ids:ijient:v:7:y:2020:i:1/2/3:p:93-106
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=104648
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijient:v:7:y:2020:i:1/2/3:p:93-106. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=167 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.