Inverting parameterized Burrows-Wheeler transform

DOI10.1007/978-3-031-98740-3_16MaRDI QIDQ6876397zbMATH OpenFDO

Authors Shogen Kawanami, Kento Iseri, Itagaki Tomohiro

Publication date 13 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-98740-3_16

zbMATH Keywords

inversion algorithmparameterized Burrows-Wheeler transformparameterized pattern matching

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A brief history of parameterized matching problems
• A suffix tree or not a suffix tree?
• A theory of parameterized pattern matching
• Breaking a barrier in constructing compact indexes for parameterized pattern matching
• Compressed Data Structures for Dynamic Sequences
• Direct linear time construction of parameterized suffix and LCP arrays for constant alphabets
• Fully functional parameterized suffix trees in compact space
• scientific article; zbMATH DE number 6850405 (Why is no real title available?)
• Inferring strings from suffix trees and links on a binary alphabet
• Mathematical Foundations of Computer Science 2003
• On the combinatorics of suffix arrays
• Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance
• Parameterized pattern matching: Algorithms and applications
• pBWT: achieving succinct data structures for parameterized pattern matching and related problems
• Reconstructing parameterized strings from parameterized suffix and LCP arrays
• Reverse engineering of compact suffix trees and links: a novel algorithm
• Simpler FM-index for parameterized string matching
• String inference from longest-common-prefix array
• Verifying and enumerating parameterized border arrays

This page was built for publication: Inverting parameterized Burrows-Wheeler transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6876397)