Faster subsequence recognition in compressed strings

Computation on compressed strings is one of the key approaches to processing massive data sets. We consider local subsequence recognition problems on strings compressed by straight-line programs (SLP), which is closely related to Lempel--Ziv compression. For an SLP-compressed text of length $\bar m$, and an uncompressed pattern of length $n$, C{\'e}gielski et al. gave an algorithm for local subsequence recognition running in time $O(\bar mn^2 \log n)$. We improve the running time to $O(\bar mn^{1.5})$. Our algorithm can also be used to compute the longest common subsequence between a compressed text and an uncompressed pattern in time $O(\bar mn^{1.5})$; the same problem with a compressed pattern is known to be NP-hard

Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

We study the approximate string matching and regular expression matching problem for the case when the text to be searched is compressed with the Ziv-Lempel adaptive dictionary compression schemes. We present a time-space trade-off that leads to algorithms improving the previously known complexities for both problems. In particular, we significantly improve the space bounds, which in practical applications are likely to be a bottleneck

A Faster Implementation of Online Run-Length Burrows-Wheeler Transform

Run-length encoding Burrows-Wheeler Transformed strings, resulting in Run-Length BWT (RLBWT), is a powerful tool for processing highly repetitive strings. We propose a new algorithm for online RLBWT working in run-compressed space, which runs in $O(n\lg r)$ time and $O(r\lg n)$ bits of space, where $n$ is the length of input string $S$ received so far and $r$ is the number of runs in the BWT of the reversed $S$. We improve the state-of-the-art algorithm for online RLBWT in terms of empirical construction time. Adopting the dynamic list for maintaining a total order, we can replace rank queries in a dynamic wavelet tree on a run-length compressed string by the direct comparison of labels in a dynamic list. The empirical result for various benchmarks show the efficiency of our algorithm, especially for highly repetitive strings.Comment: In Proc. IWOCA201

A response to “Trends in tropical tree growth: re-analysis confirms earlier findings”

We recently demonstrated that growth trends from tree rings from Van der Sleen et al. (2015) and Groenendijk et al. (2015) are affected by demographic biases. In particular, clustered age distributions led to a negative bias in their growth trends. In a response, they challenge our analysis and present an alternative correction approach. We here show that their arguments are incorrect and based on misunderstanding of our analysis, and that their alternative approach does not work

Compressed Subsequence Matching and Packed Tree Coloring

We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size $n$ compressing a string of size $N$ and a pattern string of size $m$ over an alphabet of size $\sigma$, our algorithm uses $O(n+\frac{n\sigma}{w})$ space and $O(n+\frac{n\sigma}{w}+m\log N\log w\cdot occ)$ or $O(n+\frac{n\sigma}{w}\log w+m\log N\cdot occ)$ time. Here $w$ is the word size and $occ$ is the number of occurrences of the pattern. Our algorithm uses less space than previous algorithms and is also faster for $occ=o(\frac{n}{\log N})$ occurrences. The algorithm uses a new data structure that allows us to efficiently find the next occurrence of a given character after a given position in a compressed string. This data structure in turn is based on a new data structure for the tree color problem, where the node colors are packed in bit strings.Comment: To appear at CPM '1

The role of community acceptance in planning outcomes for onshore wind and solar farms: An energy justice analysis

The deployment of renewable technologies as part of climate mitigation strategies have provoked a range of responses from various actors, bringing public acceptance to the forefront of energy debates. A key example is the reaction of communities when renewable projects are proposed in their local areas. This paper analyses the effect that community acceptance has had on planning applications for onshore wind and solar farms in Great Britain between 1990 and 2017. It does this by compiling a set of indicators for community acceptance and testing their association with planning outcomes using binomial logistic regression. It identifies 12 variables with statistically significant effects: 4 for onshore wind, 4 for solar farms, and 4 spanning both. For both technologies, the visibility of a project, its installed capacity, the social deprivation of the area, and the year of the application are significant. The paper draws conclusions from these results for community acceptance and energy justice, and discusses the implications for energy decision-making

Factorised Steady States in Mass Transport Models

We study a class of mass transport models where mass is transported in a preferred direction around a one-dimensional periodic lattice and is globally conserved. The model encompasses both discrete and continuous masses and parallel and random sequential dynamics and includes models such as the Zero-range process and Asymmetric random average process as special cases. We derive a necessary and sufficient condition for the steady state to factorise, which takes a rather simple form.Comment: 6 page

Traffic jams and ordering far from thermal equilibrium

The recently suggested correspondence between domain dynamics of traffic models and the asymmetric chipping model is reviewed. It is observed that in many cases traffic domains perform the two characteristic dynamical processes of the chipping model, namely chipping and diffusion. This correspondence indicates that jamming in traffic models in which all dynamical rates are non-deterministic takes place as a broad crossover phenomenon, rather than a sharp transition. Two traffic models are studied in detail and analyzed within this picture.Comment: Contribution to the Niels Bohr Summer Institute on Complexity and Criticality; to appear in a Per Bak Memorial Issue of PHYSICA

Dynamic Fluctuation Phenomena in Double Membrane Films

Dynamics of double membrane films is investigated in the long-wavelength limit including the overdamped squeezing mode. We demonstrate that thermal fluctuations essentially modify the character of the mode due to its nonlinear coupling to the transversal shear hydrodynamic mode. The corresponding Green function acquires as a function of the frequency a cut along the imaginary semi-axis. Fluctuations lead to increasing the attenuation of the squeezing mode it becomes larger than the `bare' value.Comment: 7 pages, Revte