Faster approximate elastic-degenerate string matching. Part B

DOI10.4230/LIPICS.CPM.2025.29MaRDI QIDQ7299465zbMATH OpenFDO

Authors Paweł Gawrychowski, Adam Górkiewicz, Pola Marciniak, Solon P. Pissis, Karol Pokorski

Publication date 17 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2025.29

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• A data structure for dynamic trees
• A unifying taxonomy of pattern matching in degenerate strings and founder graphs
• Approximate pattern matching on elastic-degenerate text
• Constructing Efficient Dictionaries in Close to Sorting Time
• Dictionary matching and indexing with errors and don't cares
• Efficient pattern matching in elastic-degenerate strings
• Efficient string matching with k mismatches
• Elastic-Degenerate String Matching via Fast Matrix Multiplication
• Elastic-degenerate string matching with 1 error or mismatch
• Fast Algorithms for Finding Nearest Common Ancestors
• Fast entropy-bounded string dictionary look-up with mismatches
• Faster approximate elastic-degenerate string matching. Part A
• Faster approximate pattern matching: a unified approach
• Faster Online Elastic Degenerate String Matching
• Few matches or almost periodicity: faster pattern matching with mismatches in compressed texts
• How fast can we multiply large integers on an actual computer?
• Title not available (Why is no real title available?)
• Linear time construction of indexable founder block graphs
• On-line pattern matching on similar texts
• Optimal suffix tree construction with large alphabets
• Uniqueness Theorems for Periodic Functions

Cited in

(1)

• Faster approximate elastic-degenerate string matching. Part A

This page was built for publication: Faster approximate elastic-degenerate string matching. Part B

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