Skip to main content
Book Chapter

A Look-Ahead Branch and Bound Pruning Scheme for Trie-Based Approximate String Matching

  • Badr G
  • Oommen J
DOI: 10.1007/3-540-32390-2_8
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Badr, G., & Oommen, J. B. (2008). A Look-Ahead Branch and Bound Pruning Scheme for Trie-Based Approximate String Matching (pp. 87–94). https://doi.org/10.1007/3-540-32390-2_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free