• Title of article

    A GREEDY APPROACH FOR COMPUTING LONGEST COMMON SUBSEQUENCES

  • Author/Authors

    BEGUM، AFROZA نويسنده ,

  • Issue Information
    سالنامه با شماره پیاپی 1 سال 2008
  • Pages
    6
  • From page
    165
  • To page
    170
  • Abstract
    This paper presents an algorithm for computing Longest Common Subsequences for two sequences. Given two strings X and Y of length m and n, we present a greedy algorithm, which requires O(n log s) preprocessing time, where s is distinct symbols appearing in string Y and O(m) time to determines Longest Common Subsequences.
  • Keywords
    Algorithms , alphabet , longest common subsequences , Greedy algorithm
  • Journal title
    Journal of Prime Research in Mathematics
  • Serial Year
    2008
  • Journal title
    Journal of Prime Research in Mathematics
  • Record number

    159163

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=159163