On Indeterminate Strings Matching.

DOI10.4230/LIPICS.CPM.2020.14MaRDI QIDQ5874442zbMATH OpenOpenAlexFDO

Authors Paweł Gawrychowski, Samah Ghazawi, Gad M. Landau

Publication date 7 February 2023

Full work available at URL https://drops.dagstuhl.de/opus/volltexte/2020/12139/pdf/LIPIcs-CPM-2020-14.pdf/

zbMATH Keywords

Cartesian treesindeterminate stringsorder-preserving matchingparameterized matchingstring matching

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cited in

(12)

• Three one-way heads cannot do string matching
• Center and distinguisher for strings with unbounded alphabet
• Elastic-degenerate string matching with 1 error
• Elastic-degenerate string matching with 1 error or mismatch
• A unifying taxonomy of pattern matching in degenerate strings and founder graphs
• Elastic-degenerate string comparison
• Computing maximal palindromes in non-standard matching models
• Computing longest common subsequence under Cartesian-tree matching model
• Computing maximal palindromes in non-standard matching models
• Subsequence matching and LCS under Cartesian-tree equivalence
• The ceBWT index: an index for circular Cartesian tree matching on multiple texts
• Extending the Burrows-Wheeler transform for Cartesian tree matching and constructing it

This page was built for publication: On Indeterminate Strings Matching.

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