Pages that link to "Item:Q1907030"

The following pages link to A subquadratic algorithm for approximate limited expression matching (Q1907030):

Displaying 12 items.

• Matching regular expressions on uncertain data (Q832529) (← links)
• Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching (Q975479) (← links)
• A sublinear algorithm for approximate keyword searching (Q1336965) (← links)
• Improved approximate pattern matching on hypertext (Q1566744) (← links)
• A fast and practical bit-vector algorithm for the longest common subsequence problem (Q1607132) (← links)
• Fast and practical approximate string matching (Q1847363) (← links)
• Approximate Boyer-Moore string matching for small alphabets (Q1957645) (← links)
• Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
• BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS (Q3421848) (← links)
• New and faster filters for multiple approximate string matching (Q4534215) (← links)
• On-Line Approximate String Searching Algorithms: Survey and Experimental Results (Q4551538) (← links)
• Multiple approximate string matching (Q5096936) (← links)