Live briefing
Everything about Longest common substring
Computer science problem
In computer science, a longest common substring of two or more strings is a longest string that is a substring of all of them. There may be more than one longest common substring. Applications include data deduplication and plagiarism detection. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Longest common substringA 5-minute orientation
- Skim a recent paper: Faster Algorithms for Longest Common SubstringInfluential work since 2022
- Pick up a classic book: Icomp 2015The most-reprinted book on the subject
- Read the landmark paper: Dynamic and Internal Longest Common SubstringCited 31 times
- Go sideways: Generalized suffix arrayA closely related topic
- Go sideways: Suffix arrayA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Dynamic and Internal Longest Common Substring
Longest common substrings with k mismatches
Linear Time Algorithms for Generalizations of the Longest Common Substring Problem
On the shortest distance between orbits and the longest common substring problem
Efficient algorithms for the longest common subsequence problem with sequential substring constraints
Longest Common Substring with Approximately k Mismatches
On the Longest Common Cartesian Substring Problem
Computing the longest common substring with one mismatch
🆕 Influential since 2022
Faster Algorithms for Longest Common Substring
Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching
An Algorithm for the Longest Common Subsequence and Substring Problem
An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings
Distributed Strain Sensing Based on Sensing Range Enhanced Optical Frequency Domain Reflectometry by Modified Longest Common Substring Algorithm
📚 Books worth reading
Icomp 2015Nev.) International Conference on Internet Computing and Big Data (2015 Las Vegas · 2016
BIOINFORMATICS ALGORITHMS,VOL.IIPhillip Compeau, Pavel Pevzner · 2015
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Generalized suffix array In computer science, a generalized suffix array (GSA) is a suffix array containing all suffixes for a set of strings. Given the set of strings S = S 1…
- Suffix array In computer science, a suffix array is a sorted array of all suffixes of a string. It is a data structure used in, among others, full-text indices, data-compres…
- Suffix tree In computer science, a suffix tree (also called PAT tree or, in an earlier form, position tree) is a compressed trie containing all the suffixes of the…
- LCP array In computer science, the longest common prefix array (LCP array) is an auxiliary data structure to the suffix array. It stores the lengths of the longest…
- Gestalt pattern matching Gestalt pattern matching, also Ratcliff/Obershelp pattern recognition, is a string-matching algorithm for determining the similarity of two strings. It…
- Levenshtein distance In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences…
- Palindrome tree In computer science a palindrome tree, also called an EerTree, is a type of search tree, that allows for fast access to all palindromes contained in a…
- Shortest common supersequence In computer science, the shortest common supersequence of two sequences X and Y is the shortest sequence which has X and Y as subsequences. This is a problem…