A novel look-ahead optimization strategy for trie-based approximate string matching

DOI10.1007/S10044-006-0036-8MaRDI QIDQ851727zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Ghada Badr, B. John Oommen

Publication date 22 November 2006

Published in PAA. Pattern Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10044-006-0036-8

zbMATH Keywords

pruningapproximate string matchingbranch-and-bound techniquesnoisy syntactic recognition using triestrie-based syntactic pattern recognition

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Data structures (68P05) Algorithms on strings (68W32)

Recommendations

• Breadth-first search strategies for trie-based syntactic pattern recognition
• Structural, Syntactic, and Statistical Pattern Recognition
• Combinatorial Pattern Matching
• An approximate string-matching algorithm
• scientific article; zbMATH DE number 975393

Cites work

• scientific article; zbMATH DE number 1303595 (Why is no real title available?)
• scientific article; zbMATH DE number 6472611 (Why is no real title available?)
• A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
• A fast algorithm for computing longest common subsequences
• A faster algorithm computing string edit distances
• A linear space algorithm for computing maximal common subsequences
• Algorithms for approximate string matching
• Order- n correction for regular languages
• Recognition of Noisy Subsequences Using Constrained Edit Distances
• The String-to-String Correction Problem

Cited in

(2)

• Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions
• Breadth-first search strategies for trie-based syntactic pattern recognition

This page was built for publication: A novel look-ahead optimization strategy for trie-based approximate string matching

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