The following pages link to (Q3315039):
Displaying 14 items.
- General methods of sequence comparison (Q799527) (← links)
- String matching with weighted errors (Q909451) (← links)
- Optimal sequence alignment allowing for long gaps (Q912793) (← 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)
- Speeding up the detection of tandem repeats over the edit distance (Q2437752) (← 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)
- From Winner-Takes-All to Winners-Share-All: Exploiting the Information Capacity in Temporal Codes (Q5157148) (← links)
