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
595
The String-to-String Correction Problem
Robert A. Wagner, Michael J. Fischer · Journal of the ACM · 1974 · 3.1K citations · Full text
Discovering similar multidimensional trajectories
Michail Vlachos, George Kollios, Dimitrios Gunopulos · 2003 · 1.5K citations
Robust and fast similarity search for moving object trajectories
Lei Chen, M. TAMER ÖZSU, Vincent Oria · 2005 · 1.3K citations
A linear space algorithm for computing maximal common subsequences
D. S. Hirschberg · Communications of the ACM · 1975 · 1.1K citations · Full text
1–5 of 595
1.3K
8
h-index
8
h-index
7
h-index
7
h-index
6
h-index
1–5 of 1.3K
553
University of California, Riverside
Riverside, United States
11 h-index
27 publications
6.3K citations
King's College London
London, United Kingdom
10 h-index
19 publications
622 citations
Princeton University
Princeton, United States
9 h-index
12 publications
3.8K citations
The University of Texas at Austin
Austin, United States
8 h-index
14 publications
949 citations
Purdue University West Lafayette
West Lafayette, United States
8 h-index
15 publications
897 citations
Kyushu University
Fukuoka, Japan
8 h-index
23 publications
420 citations
Stanford University
Stanford, United States
8 h-index
11 publications
1.5K citations

Centre National de la Recherche Scientifique
Paris, France
7 h-index
11 publications
272 citations
1–8 of 553
28 publications · 1K citations
19
h-index
18 publications · 579 citations
13
h-index
Repository · 11 publications · 364 citations
10
h-index
7 publications · 218 citations
7
h-index
JACM · 7 publications · 5.1K citations
7
h-index
1–5