Longest Common Substring is an algorithmic problem in string analysis that identifies the longest contiguous sequence of characters common to two or more input strings.
293
Publications
18.9K
Citations
579
Authors
292
Institutions
Publications per year
2017–2026
48
Parents
Publications
293
The String-to-String Correction Problem
Robert A. Wagner, Michael J. Fischer · Journal of the ACM · 1974 · 3.1K citations · Full text
A linear space algorithm for computing maximal common subsequences
D. S. Hirschberg · Communications of the ACM · 1975 · 1.1K citations · Full text
A survey of longest common subsequence algorithms
Lasse Bergroth, Harri Hakonen, T. Raita · 2002 · 648 citations
1–5 of 293
Authors
579
- CS
7
h-index
- XT
6
h-index
- CB
5
h-index
- CY
5
h-index
- SR
5
h-index
1–5 of 579
Institutions
292
King's College London
London, United Kingdom
11 h-index
18 publications
678 citations
Purdue University West Lafayette
West Lafayette, United States
8 h-index
14 publications
787 citations
Stanford University
Stanford, United States
7 h-index
10 publications
1.4K citations
The University of Texas at Austin
Austin, United States
7 h-index
12 publications
621 citations
University of Helsinki
Helsinki, Finland
7 h-index
12 publications
667 citations
Kyushu University
Fukuoka, Japan
7 h-index
13 publications
266 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
7 publications
245 citations
Universidade de São Paulo
São Paulo, Brazil
5 h-index
9 publications
276 citations
1–8 of 292
Venues
- Information Processing Letters
15 publications · 544 citations
13
h-index
- Algorithmica
11 publications · 484 citations
11
h-index
- Theoretical Computer Science
12 publications · 488 citations
11
h-index
- DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
Repository · 10 publications · 177 citations
10
h-index
- Computers & Operations Research
7 publications · 226 citations
7
h-index
1–5