scientific article
From MaRDI portal
Publication:2753929
zbMath0974.68510MaRDI QIDQ2753929
Jeffery Westbrook, Adam L. Buchsbaum, Michael T. Goodrich
Publication date: 11 November 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05)
Related Items (13)
Approximate string matching using compressed suffix arrays ⋮ A metric index for approximate string matching ⋮ From Nerode's congruence to suffix automata with mismatches ⋮ Fast index for approximate string matching ⋮ On the Suffix Automaton with Mismatches ⋮ Text indexing with errors ⋮ A linear size index for approximate pattern matching ⋮ Improved approximate string matching using compressed suffix data structures ⋮ Languages with mismatches ⋮ Improved space-time tradeoffs for approximate full-text indexing with one edit error ⋮ Cache-oblivious index for approximate string matching ⋮ Compressed indexes for approximate string matching ⋮ A new method for approximate indexing and dictionary lookup with one error
This page was built for publication:
