The following pages link to (Q3315039):
Displaying 30 items.
- A new filtration method and a hybrid strategy for approximate string matching (Q385045) (← links)
- On-line approximate string matching with bounded errors (Q653329) (← links)
- Approximate string matching with suffix automata (Q689099) (← links)
- General methods of sequence comparison (Q799527) (← links)
- String matching with weighted errors (Q909451) (← links)
- Optimal sequence alignment allowing for long gaps (Q912793) (← links)
- An integer linear programming approach for approximate string comparison (Q1042045) (← links)
- Optimal sequence alignment using affine gap costs (Q1085098) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← links)
- Fast string matching with k differences (Q1109574) (← links)
- A survey of multiple sequence comparison methods (Q1191624) (← links)
- Lazy dynamic-programming can be eager (Q1199883) (← links)
- Using Hirschberg's algorithm to generate random alignments of strings (Q1336757) (← links)
- Efficient matching of nonrectangular shapes. (Q1354075) (← links)
- Approximate regular expression matching with multi-strings (Q2376798) (← links)
- Speeding up the detection of tandem repeats over the edit distance (Q2437752) (← links)
- Optimal spaced seeds for faster approximate string matching (Q2643727) (← links)
- Fast string matching in stationary ergodic sources (Q2785374) (← links)
- Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance (Q2946041) (← links)
- Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment (Q2948308) (← links)
- Approximate String Matching: A Simpler Faster Algorithm (Q3149893) (← links)
- Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time (Q3188843) (← links)
- (Q4661875) (← links)
- Boosting the Quality of Approximate String Matching by Synonyms (Q5012537) (← links)
- Boyer-Moore approach to approximate string matching (Q5056116) (← links)
- Multiple approximate string matching (Q5096936) (← links)
- From Winner-Takes-All to Winners-Share-All: Exploiting the Information Capacity in Temporal Codes (Q5157148) (← links)
- Approximate String Matching Using a Bidirectional Index (Q5165608) (← links)
- Average-optimal single and multiple approximate string matching (Q5463450) (← links)
- String Matching: Communication, Circuits, and Learning. (Q5875515) (← links)
