scientific article; zbMATH DE number 910912

MaRDI QIDQ4886089zbMATH OpenFDO

Authors Brenda S. Baker

Publication date 22 August 1996

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cited in

(18)

• The structural border array
• Parameterized longest previous factor
• Efficient parameterized string matching
• Variations of the parameterized longest previous factor
• Towards optimal approximate streaming pattern matching by matching multiple patterns in multiple streams
• Dynamic dictionary matching in external memory
• On the longest common parameterized subsequence
• Weighted approximate parameterized string matching
• p-suffix sorting as arithmetic coding
• Position heaps for Cartesian-tree matching on strings and tries
• Compressed parameterized pattern matching
• Fast parameterized matching with \(q\)-grams
• Counting Parameterized Border Arrays for a Binary Alphabet
• Efficient pattern matching for RNA secondary structures
• A brief history of parameterized matching problems
• Verifying and enumerating parameterized border arrays
• On the Longest Common Parameterized Subsequence
• A prefix array for parameterized strings

This page was built for publication:

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