Live briefing
Everything about Suffix array
Data structure for a string
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-compression algorithms, and the field of bibliometrics. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Suffix arrayA 5-minute orientation
- Skim a recent paper: Generic Non-recursive Suffix Array ConstructionInfluential work since 2022
- Pick up a classic book: C How to ProgramThe most-reprinted book on the subject
- Read the landmark paper: Suffix Arrays: A New Method for On-Line String SearchesCited 1,299 times
- Go sideways: LCP arrayA closely related topic
- Go sideways: Generalized suffix arrayA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Suffix Arrays: A New Method for On-Line String Searches
Replacing suffix trees with enhanced suffix arrays
Linear work suffix array construction
A taxonomy of suffix array construction algorithms
Two Efficient Algorithms for Linear Time Suffix Array Construction
Engineering a Lightweight Suffix Array Construction Algorithm
GHOSTX: An Improved Sequence Homology Search Algorithm Using a Query Suffix Array and a Database Suffix Array
Better external memory suffix array construction
🆕 Influential since 2022
Generic Non-recursive Suffix Array Construction
SaAlign: Multiple DNA/RNA sequence alignment and phylogenetic tree construction tool for ultra-large datasets and ultra-long sequences based on suffix array
An OTA Upgrade Differential Compression Algorithm Based on Suffix Array Induced Sorting and BsDiff Methods
Formally Verified Suffix Array Construction
Fast, parallel, and cache-friendly suffix array construction
📚 Books worth reading
C How to ProgramPaul J. Deitel, Harvey M. Deitel · 2007
Fundamentals of data structures in CEllis Horowitz · 1993
C# 4.0 in a nutshellJoseph Albahari · 2010
Data Structures and Algorithms in JavaMichael T. Goodrich, Roberto Tamassia · 2014
Data structures, algorithms, and performanceDerick Wood · 1992
The Burrowswheeler Transform Data Compression Suffix Arrays And Pattern MatchingDonald Adjeroh · 2010
The Burrowswheeler Transform Data Compression Suffix Arrays And Pattern MatchingTimothy Bell · 2008- 📕Burrows-Wheeler Transform : Donald Adjeroh, Timothy Bell · 2008
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- 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…
- 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…
- Range minimum query In computer science, a range minimum query (RMQ) solves the problem of finding the minimal value in a sub-array of an array of comparable objects. Range…
- 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…
- Compressed suffix array In computer science, a compressed suffix array is a compressed data structure for pattern matching. Compressed suffix arrays are a general class of data…
- 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…
- 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…
- Succinct data structure In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower bound…