• DocumentCode
    3162146
  • Title

    An optimal algorithm for the longest common subsequence problem

  • Author

    Lin, Hua ; Lu, Mi ; Fang, Jesse

  • Author_Institution
    Texas A&M Univ., College Station, TX, USA
  • fYear
    1991
  • fDate
    2-5 Dec 1991
  • Firstpage
    630
  • Lastpage
    639
  • Abstract
    The longest common subsequence problem is to find a longest common subsequence of two given strings. The complexity of this problem on the decision tree model is known as mn, where m and n are the lengths of these two strings, respectively, and m⩽n. The authors present a parallel algorithm for this problem on the CREW PRAM model, which takes O(log2mloglogm) time with mn/log2mloglogm processors when log2mloglogm>logn, or otherwise O(logn) time with mn logn processors
  • Keywords
    computational complexity; parallel algorithms; random-access storage; CREW PRAM model; complexity; decision tree model; longest common subsequence problem; optimal algorithm; parallel algorithm; Computational modeling; Concurrent computing; Grid computing; Laboratories; Parallel algorithms; Phase change random access memory; Read-write memory;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on
  • Conference_Location
    Dallas, TX
  • Print_ISBN
    0-8186-2310-1
  • Type

    conf

  • DOI
    10.1109/SPDP.1991.218203
  • Filename
    218203
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3162146