Average-case analysis of approximate trie search

DOI10.1007/S00453-006-0126-4zbMATH Open1106.68030OpenAlexW2027362887MaRDI QIDQ866965FDOQ866965

Authors: Moritz G. Maaß 

Publication date: 14 February 2007

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-006-0126-4

Recommendations

• Combinatorial Pattern Matching
• Towards a complete characterization of tries
• An approximate string-matching algorithm
• Average complexity of exact and approximate multiple string matching
• Profile of Tries

zbMATH Keywords

Hamming distance

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10)

Cited In (5)

• Combinatorial Pattern Matching
• Average-Case Lower Bounds for Searching
• Improved approximation algorithms for the average-case tree searching problem
• Compressed directed acyclic word graph with application in local alignment
• Title not available (Why is that?)

This page was built for publication: Average-case analysis of approximate trie search

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