• DocumentCode
    2045561
  • Title

    Parallel algorithms for the longest common subsequence problem

  • Author

    Babu, K. Nandan ; Saxena, Sanjeev

  • Author_Institution
    Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kanpur, India
  • fYear
    1997
  • fDate
    18-21 Dec 1997
  • Firstpage
    120
  • Lastpage
    125
  • Abstract
    The longest common subsequence problem is to find a substring that is common to two given strings and is at least as long as any other such string. If m and n are the lengths of the two strings (m<2), we obtain O(log m) time parallel algorithm with mn processors and an O(log 2 n) time optimal parallel algorithm. Serial complexity on the decision tree model is Θ(mn)
  • Keywords
    computational complexity; graph theory; parallel algorithms; string matching; CRCW model; decision tree model; grid directed acyclic graph; longest common subsequence problem; parallel algorithms; serial complexity; substring; time optimal parallel algorithm; Computer science; Costs; Data compression; Data engineering; Decision trees; Parallel algorithms; Pattern recognition;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    High-Performance Computing, 1997. Proceedings. Fourth International Conference on
  • Conference_Location
    Bangalore
  • Print_ISBN
    0-8186-8067-9
  • Type

    conf

  • DOI
    10.1109/HIPC.1997.634481
  • Filename
    634481
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2045561