#### DMCA

## Permuted longest-common-prefix array (2009)

Venue: | In Proc. 20th CPM, LNCS 5577 |

Citations: | 17 - 2 self |

### Citations

835 | Suffix Arrays: A New Method for On-Line String Searches
- Manber, Myers
- 1993
(Show Context)
Citation Context ...ncluding the fastest known LCP construction algorithm and some extremely space efficient algorithms. We also prove a new combinatorial property of the LCP values. 1 Introduction The suffix array (SA) =-=[13]-=- is a lexicographically sorted list of all the suffixes in a string. The longest-common-prefix (LCP) array stores the lengths of the longestcommon-prefixes of adjacent suffixes in SA. Augmenting SA wi... |

558 |
Algorithms on Strings, Trees and Se-quences: Computer Science and Computational Biology. Cambridge
- Gusfield
- 1997
(Show Context)
Citation Context .... Augmenting SA with LCP allows many problems in string processing to be solved in optimal time and space. In particular the LCP array is key for: efficiently simulating traversals of the suffix tree =-=[22,5]-=- (top-down, bottom up, suffix link walks) with the suffix array [1]; pattern matching on the suffix array in attractive theoretical bounds [13,1]; fast disk based suffix array arrangements [3,21]; and... |

546 | Linear pattern matching algorithms. In:
- Weiner
- 1973
(Show Context)
Citation Context .... Augmenting SA with LCP allows many problems in string processing to be solved in optimal time and space. In particular the LCP array is key for: efficiently simulating traversals of the suffix tree =-=[22,5]-=- (top-down, bottom up, suffix link walks) with the suffix array [1]; pattern matching on the suffix array in attractive theoretical bounds [13,1]; fast disk based suffix array arrangements [3,21]; and... |

263 | Compressed full-text indexes
- Navarro, Mäkinen
(Show Context)
Citation Context ...ents, full representations of the text, the SA, and the LCP array cannot be stored (simultaneously) in RAM. There are many methods for SA addressing this problem, including compressed representations =-=[15]-=-, external storage [21], and external and semi-external construction [2,6]. The few LCP related improvements have been concerned with the space too (see Section 2). In this paper we show that a natura... |

215 | Simple Linear Work Suffix Array Construction, in
- Kärkkäinen, Sanders
(Show Context)
Citation Context ...pute the LCP array as a byproduct of their O(n log n) time SA construction algorithm. The linear time SA construction algorithm of Kärkkäinen and Sanders can also be modified to produce the LCP array =-=[7]-=-. Other SA construction algorithms could probably be modified so too, but a more attractive approach was introduced by Kasai et al. [8], who gave a simple algorithm to construct the LCP array from an ... |

207 | Replacing suffix trees with enhanced suffix arrays
- Abouelhoda
- 2004
(Show Context)
Citation Context ...be solved in optimal time and space. In particular the LCP array is key for: efficiently simulating traversals of the suffix tree [22,5] (top-down, bottom up, suffix link walks) with the suffix array =-=[1]-=-; pattern matching on the suffix array in attractive theoretical bounds [13,1]; fast disk based suffix array arrangements [3,21]; and compressed suffix trees [4]. Various methods for suffix arrays hav... |

137 | The string b-tree: a new data structure for string search in external memory and its applications.
- Ferragina, Grossi
- 1999
(Show Context)
Citation Context ...tree [22,5] (top-down, bottom up, suffix link walks) with the suffix array [1]; pattern matching on the suffix array in attractive theoretical bounds [13,1]; fast disk based suffix array arrangements =-=[3,21]-=-; and compressed suffix trees [4]. Various methods for suffix arrays have been extensively investigated but the LCP array has received much less attention. Several very fast SA construction algorithms... |

113 | Linear-time longestcommon prefix computation in suffix arrays and its applications”,
- KASAI, LEE, et al.
- 2006
(Show Context)
Citation Context ...s attention. Several very fast SA construction algorithms have been developed in recent years [17], but there has been no improvement in LCP construction time since the original LCP-from-SA algorithm =-=[8]-=-. Furthermore, the fastest SA construction algorithms are also space economical, which is not the case with LCP construction. This is a problem since space is ⋆ This work is supported by the Academy o... |

108 |
New text indexing functionalities of the compressed suffix arrays
- Sadakane
(Show Context)
Citation Context ...he φ Array Our first PLCP construction algorithm uses another array Φ[0..n−1]. 2 For every j ∈ 1..n, Φ[SA[j]] = SA[j − 1]. 2 The Φ array is so named because it is in some way symmetric to the Ψ array =-=[20]-=-.Permuted Longest-Common-Prefix Array 187 — Compute Φq 1: for i ← 0 to n − 1 do 2: if SA[i] modq =0then 3: Φ[SA[i]/q] ← SA[i−1] — Turn Φq into PLCPq 4: ℓ ← 0 5: for i ← 0 to ⌊(n − 1)/q⌋ do 6: j ← Φq[... |

81 | K.: Practical entropy-compressed rank/select dictionary. Arxiv preprint cs/0610001
- Okanohara, Sadakane
- 2006
(Show Context)
Citation Context ... answered in O(1) time given an additional data structure of o(n) bits. Several such select-structures are known in the literature, the most practical of these for our purposes is probably the darray =-=[16]-=-. Summing up, the succinct bitarray representation takes 2n+o(n) bits and supports random access to LCP values in O(1) time. We have implemented our own optimized variant of the darray structure using... |

77 | A.H.: A taxonomy of suffix array construction algorithms.
- Puglisi, Smyth, et al.
- 2007
(Show Context)
Citation Context ...rious methods for suffix arrays have been extensively investigated but the LCP array has received much less attention. Several very fast SA construction algorithms have been developed in recent years =-=[17]-=-, but there has been no improvement in LCP construction time since the original LCP-from-SA algorithm [8]. Furthermore, the fastest SA construction algorithms are also space economical, which is not t... |

53 | Succinct representations of lcp information and improvements in the compressed suffix arrays. - Sadakane - 2002 |

44 | Two space saving tricks for linear time LCP computation
- Manzini
- 2004
(Show Context)
Citation Context ...xtra space to n words by eliminating the need for an extra working array through essentially reordering computation. Two different ways to achieve this have been described by Mäkinen [12] and Manzini =-=[14]-=-. Manzini also gives another algorithm that saves space by overwriting SA with LCP, which is not possible with earlier algorithms. It needs n bytes plus n words of extra space in the worst case but us... |

40 | Better external memory suffix array construction.
- Dementiev, Karkkainen, et al.
- 2008
(Show Context)
Citation Context ...be stored (simultaneously) in RAM. There are many methods for SA addressing this problem, including compressed representations [15], external storage [21], and external and semi-external construction =-=[2,6]-=-. The few LCP related improvements have been concerned with the space too (see Section 2). In this paper we show that a natural and effective way to reduce the time and space costs of LCP computation ... |

29 | Fast BWT in small space by blockwise suffix sorting
- Kärkkäinen
(Show Context)
Citation Context ...be stored (simultaneously) in RAM. There are many methods for SA addressing this problem, including compressed representations [15], external storage [21], and external and semi-external construction =-=[2,6]-=-. The few LCP related improvements have been concerned with the space too (see Section 2). In this paper we show that a natural and effective way to reduce the time and space costs of LCP computation ... |

21 |
Compact suffix array - a space-efficient full-text index.
- Makinen
- 2003
(Show Context)
Citation Context ...thm reduced the extra space to n words by eliminating the need for an extra working array through essentially reordering computation. Two different ways to achieve this have been described by Mäkinen =-=[12]-=- and Manzini [14]. Manzini also gives another algorithm that saves space by overwriting SA with LCP, which is not possible with earlier algorithms. It needs n bytes plus n words of extra space in the ... |

15 | An(other) entropy-bounded compressed suffix tree.
- Fischer, Makinen, et al.
- 2008
(Show Context)
Citation Context ...ffix link walks) with the suffix array [1]; pattern matching on the suffix array in attractive theoretical bounds [13,1]; fast disk based suffix array arrangements [3,21]; and compressed suffix trees =-=[4]-=-. Various methods for suffix arrays have been extensively investigated but the LCP array has received much less attention. Several very fast SA construction algorithms have been developed in recent ye... |

11 | Improving suffix array locality for fast pattern matching on disk
- Sinha, Puglisi, et al.
- 2008
(Show Context)
Citation Context ...tree [22,5] (top-down, bottom up, suffix link walks) with the suffix array [1]; pattern matching on the suffix array in attractive theoretical bounds [13,1]; fast disk based suffix array arrangements =-=[3,21]-=-; and compressed suffix trees [4]. Various methods for suffix arrays have been extensively investigated but the LCP array has received much less attention. Several very fast SA construction algorithms... |

8 | Space-time tradeoffs for longest-common-prefix array computation
- Puglisi, Turpin
- 2008
(Show Context)
Citation Context ...l access patterns help in reducing space, too. With the exception of Φip, all our construction algorithms process SA in sequential order and can produce the LCP array in sequential order. Thus, as in =-=[18]-=-, we can keep SA and LCP on disk without an excessive slow-down obtaining semi-external algorithms that need RAM only for the text and the PLCP representation, which is only 3n bits for the bitarray a... |

1 | Memorial website of Dima Khmelev - Kelbert - 2006 |

1 |
Program lcp version 0.1.9
- Khmelev
- 2004
(Show Context)
Citation Context ...d LCP (PLCP) array in which the values appear in position order, rather than lexicographical order. The PLCP array has played a role in previous algorithms implicitly (see Lemma 1) or even explicitly =-=[19,11]-=-, but we bring it to the center stage. We use the PLCP array as the central piece that connects a number of techniques (old and new) into a family of algorithms. One advantage of the PLCP array over t... |