Live briefing
Everything about Substring
Contiguous part of a sequence of symbols
In formal language theory and computer science, a substring is a contiguous sequence of characters within a string. For instance, "the best of" is a substring of "It was the best of times". In contrast, "Itwastimes" is a subsequence of "It was the best of times", but not a substring. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: SubstringA 5-minute orientation
- Skim a recent paper: Panel-to-Substring PWM Differential Power Processing Converter and Its Maximum Power Point Tracking Technique for Solar Roof of Plug-In Electric VehiclesInfluential work since 2022
- Pick up a classic book: Computational Thinking for the Modern Problem SolverThe most-reprinted book on the subject
- Read the landmark paper: A very fast substring search algorithmCited 231 times
- Go sideways: Shortest common supersequenceA closely related topic
- Go sideways: Sardinas–Patterson algorithmA closely related topic
📖 Definitions
Noun A (possibly zero-length) string of characters that is contained in another string.
Verb To extract a substring from.
Verb To take as a substring.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A very fast substring search algorithm
The Average Common Substring Approach to Phylogenomic Reconstruction
On the closest string and substring problems
Robust and Reverse-Engineering Resilient PUF Authentication and Key-Exchange by Substring Matching
kmacs: the k -mismatch average common substring approach to alignment-free sequence comparison
Implementation of the substring test by hashing
Substring-Searchable Symmetric Encryption
String Reconstruction from Substring Compositions
🆕 Influential since 2022
Panel-to-Substring PWM Differential Power Processing Converter and Its Maximum Power Point Tracking Technique for Solar Roof of Plug-In Electric Vehicles
Cardinality estimation of approximate substring queries using deep learning
Stable DNA Storage Encoding Scheme Based on Repeating Substring Tree
On the Longest Common Cartesian Substring Problem
Efficient privacy-preserving variable-length substring match for genome sequence
📚 Books worth reading
Computational Thinking for the Modern Problem SolverKenny A. Hunt, David D. Riley · 2014
Fundamentals of data structures in CEllis Horowitz · 1993- 📕Full-Text (Substring) Indexes in External MemoryMarina Barsky, Alex Thomo · 2011
Introduction to C ProgrammingReema Thareja · 2013
Teach Yourself REXX in 21 daysWilliam F. Schindler, Esther Schindler · 1994
Programming in C#E. Balagurusamy · 2002
Learn to Program with PythonIrv Kalb · 2016
Apache Solr 3 Enterprise Search ServerDavid Smiley · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- 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…
- Sardinas–Patterson algorithm In coding theory, the Sardinas–Patterson algorithm is a classical algorithm for determining in polynomial time whether a given variable-length code is…
- Longest common substring Wikibooks has a book on the topic of: Algorithm Implementation/Strings/Longest common substring In computer science, a longest common substring of two…
- Longest common subsequence A longest common subsequence (LCS) is the longest subsequence common to all sequences in a set of sequences (often just two sequences). It differs from…
- 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 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…
- Subsequence In mathematics, a subsequence of a given sequence is a sequence that can be derived from the given sequence by deleting some or no elements without changing…
- Suffix automaton In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage…