• Home
  • Search
  • Computing matching statistics on Wheeler DFAs.
  • Open Access IconOpen Access
  • Cite Icon5
  • https://doi.org/10.1109/dcc55655.2023.00023Copy DOI Icon

Computing matching statistics on Wheeler DFAs.

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
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.

Similar Papers
  • Book Chapter
  • Citations7

Divide and Conquer Computation of the Multi-string BWT and LCP Array

  • Jan 01, 2018
  • Paola Bonizzoni +5
  • Book Chapter
  • Citations7

In-Place Sparse Suffix Sorting

  • Jan 01, 2018
  • Nicola Prezza
  • Book Chapter
  • Citations165

Permuted Longest-Common-Prefix Array

  • Jan 01, 2009
  • Juha Kärkkäinen +2
  • PDF
  • Research Article
  • Citations7

LibFLASM: a software library for fixed-length approximate string matching

  • Nov 10, 2016
  • BMC Bioinformatics
  • Lorraine A K Ayad +2
  • Conference Article
  • Citations10

Suffix trees (and relatives) come of age in bioinformatics

  • Aug 14, 2002
  • D Gusfield
  • Research Article
  • Citations5

Error Tree: A Tree Structure for Hamming and Edit Distances and Wildcards Matching

  • Sep 24, 2015
  • Journal of Computational Biology
  • Anas Al-Okaily
  • Book Chapter
  • Citations10

Time and Space Efficient Algorithms for Constrained Sequence Alignment

  • Jan 01, 2005
  • Z S Peng +1
  • Research Article
  • Citations5

An efficient pruning strategy for approximate string matching over suffix tree

  • Nov 06, 2015
  • Knowledge and Information Systems
  • Huan Hu +3
  • Research Article

On suffix tree detection

  • Jul 10, 2024
  • Theoretical Computer Science
  • Amihood Amir +2
  • PDF
  • Research Article
  • Citations3

Solving String Problems on Graphs Using the Labeled Direct Product

  • Jul 05, 2022
  • Algorithmica
  • Nicola Rizzo +2
  • Supplementary Content
  • Citations1

Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space

  • Jan 01, 2021
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Dhrumil Patel +1
  • Research Article
  • Citations51

Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications

  • Nov 18, 2004
  • Journal of Computer and System Sciences
  • Michael H Goldwasser +2
  • Research Article
  • Citations1

4-러시안 알고리즘 기반의 편집거리 병렬계산

  • Feb 28, 2013
  • KIPS Transactions on Computer and Communication Systems
  • Young Ho Kim +3
  • Book Chapter
  • Citations36

Fully-Compressed Suffix Trees

  • Apr 07, 2008
  • Luís M S Russo +2
  • Research Article
  • Citations9

Weighted approximate parameterized string matching

  • Dec 29, 2016
  • AKCE International Journal of Graphs and Combinatorics
  • Shibsankar Das +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.