A novel look-ahead optimization strategy for trie-based approximate string matching (Q851727): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60327964, #quickstatements; #temporary_batch_1710979808849
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10044-006-0036-8 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q5501814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear space algorithm for computing maximal common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm computing string edit distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of Noisy Subsequences Using Constrained Edit Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order- <i>n</i> correction for regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/paa/BadrO06 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10044-006-0036-8 / rank
 
Normal rank

Latest revision as of 05:21, 10 December 2024

scientific article
Language Label Description Also known as
English
A novel look-ahead optimization strategy for trie-based approximate string matching
scientific article

    Statements

    A novel look-ahead optimization strategy for trie-based approximate string matching (English)
    0 references
    0 references
    0 references
    22 November 2006
    0 references
    trie-based syntactic pattern recognition
    0 references
    approximate string matching
    0 references
    noisy syntactic recognition using tries
    0 references
    branch-and-bound techniques
    0 references
    pruning
    0 references

    Identifiers