scientific article; zbMATH DE number 1306895

zbMath0938.68918MaRDI QIDQ4252748

S. Rao Kosaraju

Publication date: 26 April 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Related Items (21)

Weighted approximate parameterized string matching ⋮ The structural border array ⋮ Variations of the parameterized longest previous factor ⋮ \(p\)-suffix sorting as arithmetic coding ⋮ Parameterized DAWGs: efficient constructions and bidirectional pattern searches ⋮ On the Longest Common Parameterized Subsequence ⋮ Compressed parameterized pattern matching ⋮ On-line construction of parameterized suffix trees for large alphabets ⋮ Parameterized longest previous factor ⋮ Verifying and enumerating parameterized border arrays ⋮ A framework for designing space-efficient dictionaries for parameterized and order-preserving matching ⋮ Frequency-based similarity for parameterized sequences: formal framework, algorithms, and applications ⋮ Efficient pattern matching for RNA secondary structures ⋮ A prefix array for parameterized strings ⋮ Approximation algorithms for maximum two-dimensional pattern matching ⋮ Counting Parameterized Border Arrays for a Binary Alphabet ⋮ A brief history of parameterized matching problems ⋮ Fast parameterized matching with \(q\)-grams ⋮ Comparison and evaluation of code clone detection techniques and tools: A qualitative approach ⋮ Dynamic dictionary matching in external memory ⋮ On the longest common parameterized subsequence

This page was built for publication: