Linear work suffix array construction
By Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt. 2006
427 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Hardware and Architecture, Molecular Biology
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Hardware and Architecture
In Molecular Biology
- William F. Smyth
- Andrew Turpin
- Daniel Povey
- Simon J. Puglisi
- Wai Hong Chan
- Sen Zhang
- Ge Nong
- Steven S. Skiena
Citations in the corpus
- Libriheavy: A 50,000 Hours ASR Corpus with Punctuation Casing and Context (2023, methodology): “First, we concatenate query and target to a long sequence (target follows query), then a suffix array is constructed on the sequence using the algorithm in [16].”
- A taxonomy of suffix array construction algorithms (2007, methodology): “KS [K¨arkk¨ainen and Sanders 2003; K¨arkk¨ainen et al. 2006].”
- Linear Suffix Array Construction by Almost Pure Induced-Sorting (2009, background): “The intuition behind the induced sorting is that the significant redundancies buried in the suffixes that nest one in another can be used to propagate the order of certain representative suffixes to their left-hand longer neighbours.”