#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2012

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Matevz Jekovec, Andrej Brodnik
- ArXiv
- 2015

Given the query string of length m, we explore a parallel query in a static suffix tree based data structure for p n, where p is the number of processors and n is the length of the text. We present three results on CREW PRAM. The parallel query in the suffix trie requires O(m + p) work, O(m/p + lg p) time and O(n 2) space in the worst case. We extend the… (More)

- Matevz Jekovec, Janez Demsar, Andrej Brodnik
- ICMC
- 2012

- Matevz Jekovec, Andrej Brodnik
- ArXiv
- 2014

Efficient construction of the suffix tree given an input text is an active area of research from the time it was first introduced. Both theoretical computer scientists and engineers tackled the problem. In this paper we focus on the fastest practical suffix tree construction algorithm to date, ERA. We first provide a theoretical analysis of the algorithm… (More)

- ‹
- 1
- ›