Space efficient linear time construction of suffix arrays
By Pang Ko, Srinivas Aluru. 2003
448 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Molecular Biology, Algorithms & Complexity
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
- Gonzalo Navarro
- Veli Mäkinen
- Stefan Kurtz
- Peter Sanders
- Wai Hong Chan
- Sen Zhang
- Ge Nong
- Juha Kärkkäinen
In Molecular Biology
- Stefan Kurtz
- Gonzalo Navarro
- Veli Mäkinen
- Peter Sanders
- Wai Hong Chan
- Sen Zhang
- Ge Nong
- Juha Kärkkäinen
In Algorithms & Complexity
- Gonzalo Navarro
- Veli Mäkinen
- Peter Sanders
- Wai Hong Chan
- Sen Zhang
- Ge Nong
- Juha Kärkkäinen
- Stefan Kurtz
Citations in the corpus
- Simple Linear Work Suffix Array Construction (2003, background): “model of computation complexity alphabet source RAM O(n logn) time general [31,30,5] O(n) time integer [11,28,29],skew”
- Compressed full-text indexes (2007, methodology): “There are several more sophisticated algorithms, from the original O(n log n) time [Manber and Myers 1993] to the latest O(n) time algorithms [Kim et al. 2005a; Ko and Aluru 2005; K¨ainen and Sanders arkk¨2003].”
- Replacing suffix trees with enhanced suffix arrays (2004, background): “Very recently, it was shown independently and contemporaneously in [19,21,23] that a direct linear time construction of the suffix array is possible.”
- A taxonomy of suffix array construction algorithms (2007, unknown): “KA [Ko and Aluru 2003, 2005].”
- Linear Suffix Array Construction by Almost Pure Induced-Sorting (2009, methodology): “The framework of the KA algorithm can be recapitulated as the following 3-step recursive process.”