Pages that link to "Item:Q5930159"

The following pages link to A randomized algorithm for approximate string matching (Q5930159):

Displaying 19 items.

• On approximate pattern matching with thresholds (Q522963) (← links)
• Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (Q534777) (← links)
• The approximate swap and mismatch edit distance (Q604463) (← links)
• An analysis of the Karp-Rabin string matching algorithm (Q911281) (← links)
• An integer linear programming approach for approximate string comparison (Q1042045) (← links)
• Identification of random strings through statistical estimation of transition vectors (Q1281047) (← links)
• Using Hirschberg's algorithm to generate random alignments of strings (Q1336757) (← links)
• On string matching with mismatches (Q1736652) (← links)
• Approximate hashing for bioinformatics (Q2117679) (← links)
• A lower-variance randomized algorithm for approximate string matching (Q2444913) (← links)
• An acceleration of FFT-based algorithms for the match-count problem (Q2628276) (← links)
• Optimal spaced seeds for faster approximate string matching (Q2643727) (← links)
• Fast string matching in stationary ergodic sources (Q2785374) (← links)
• Efficient randomized pattern-matching algorithms (Q3799643) (← links)
• Boyer-Moore approach to approximate string matching (Q5056116) (← links)
• Randomized and Parameterized Algorithms for the Closest String Problem (Q5165596) (← links)
• A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM (Q5434994) (← links)
• (Q5874401) (← links)
• A literature survey of matrix methods for data science (Q6068265) (← links)