Related Experiment Video
Updated: Jun 24, 2025

Inverse Probability of Treatment Weighting Propensity Score using the Military Health System Data Repository and National Death Index
Published on: January 8, 2020
Computing matching statistics on Wheeler DFAs
Alessio Conte1, Nicola Cotumaccio2,3, Travis Gagie3
1University of Pisa, Italy.
Abstract:
Matching statistics were introduced to solve the approximate string matching problem, which is a recurrent subroutine in bioinformatics applications. In 2010, Ohlebusch et al. [SPIRE 2010] proposed a time and space efficient algorithm for computing matching statistics which relies on some components of a compressed suffix tree - notably, the longest common prefix (LCP) array. In this paper, we show how their algorithm can be generalized from strings to Wheeler deterministic finite automata. Most importantly, we introduce a notion of LCP array for Wheeler automata, thus establishing a first clear step towards extending (compressed) suffix tree functionalities to labeled graphs.
More Related Videos
Related Concept Videos
Friedman Two-way Analysis of Variance by Ranks
Wilcoxon Signed-Ranks Test for Matched Pairs
Wald-Wolfowitz Runs Test I
The test works...
Wilcoxon Signed-Ranks Test for Median of Single Population
Fisher's Exact Test
Statistical Analysis System (SAS)
Applications: SAS finds applications in numerous fields, including healthcare for clinical trial analysis, finance for risk assessment, marketing for customer data analysis, and...

