Søren Vind
Technical University of Denmark
16 Papers
85 Citations
Søren Vind is an academic researcher from Technical University of Denmark. The author has contributed to research in topics: String (computer science) & Substring. The author has an hindex of 5, co-authored 16 publications.
Chat about Author
Papers
Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation
Philip Bille,Anders Roy Christiansen,Patrick Hagge Cording,Inge Li Gørtz,Frederik Rye Skjoldjensen,Hjalte Wedel Vildhøj,Søren Vind +6 more
TL;DR: In this paper, the authors study relative compression in a dynamic setting where the compressed source string S is subject to edit operations and present new data structures that achieve optimal time for updates and queries while using space linear in the size of the optimal relative compression, for nearly all combinations of parameters.
String indexing for patterns with wildcards
Philip Bille,Inge Li Gørtz,Hjalte Wedel Vildhøj,Søren Vind +3 more
- 04 Jul 2012
TL;DR: This work considers the problem of indexing a string t to report the occurrences of a query pattern p containing m characters and j wildcards, and obtains an index with query time O(m+j+occ) using space O(\sigma^{k^2} n \log^k\log n)$, where k is the maximum number of wildcards allowed in the pattern.
•Posted Content
Fingerprints in Compressed Strings
Philip Bille,Patrick Hagge Cording,Inge Li Gørtz,Benjamin Sach,Hjalte Wedel Vildhøj,Søren Vind +5 more
TL;DR: The first O(n) space data structures that answer fingerprint queries without decompressing any characters were presented in this article, where they were used to solve the longest common extension problem in query time $O(log N \log \lce)$ and O(log LCE + \log\log N)$ for SLPs and Linear SLPs, respectively.
Fingerprints in compressed strings
Philip Bille,Patrick Hagge Cording,Inge Li Gørtz,Benjamin Sach,Hjalte Wedel Vildhøj,Søren Vind +5 more
- 12 Aug 2013
TL;DR: This paper presents the first O(n) space data structures that answer fingerprint queries without decompressing any characters, and utilizes the fingerprint data structures to solve the longest common extension problem in query time O(logNlogl) and O( loglloglogl+loglogN) for SLPs and Linear SLPs, respectively.
Colored Range Searching in Linear Space
Roberto Grossi,Søren Vind +1 more
- 02 Jul 2014
TL;DR: In colored range searching, the authors are given a set of n colored points in d ≥ 2 dimensions to store, and want to support orthogonal range queries taking colors into account.
8