Longest Common Subsequence

Longest Common Subsequence is a fundamental string comparison problem in computer science that identifies the longest subsequence common to two or more sequences, where a subsequence preserves the order of characters but not necessarily their contiguity.

595

Publications

47.3K

Citations

1.3K

Authors

553

Institutions

Publications per year

2017–2026

99

Authors

1.3K

  1. CS
    Costas S. Iliopoulos

    King's College London, United Kingdom

    8 publications · 235 citations

    8

    h-index

  2. CY
    Chang‐Biau Yang

    National Sun Yat-sen University, Taiwan

    8 publications · 189 citations

    8

    h-index

  3. XT
    Xiaoping Tang

    The University of Texas at Austin, United States

    7 publications · 478 citations

    7

    h-index

  4. YS
    Yi Shang

    University of Missouri, United States

    7 publications · 234 citations

    7

    h-index

  5. AA
    Amir Abboud

    Stanford University, United States

    6 publications · 350 citations

    6

    h-index

1–5 of 1.3K

Venues

  1. Information Processing Letters

    28 publications · 1K citations

    19

    h-index

  2. Theoretical Computer Science

    18 publications · 579 citations

    13

    h-index

  3. arXiv (Cornell University)

    Repository · 11 publications · 364 citations

    10

    h-index

  4. Journal of Discrete Algorithms

    7 publications · 218 citations

    7

    h-index

  5. Journal of the ACM

    JACM · 7 publications · 5.1K citations

    7

    h-index

1–5