The following pages link to Carl Barton (Q507392):
Displayed 15 items.
- Linear-time computation of prefix table for weighted strings {\&} applications (Q507393) (← links)
- Crochemore's partitioning on weighted strings and applications (Q1709578) (← links)
- Indexing weighted sequences: neat and efficient (Q2288210) (← links)
- Global and local sequence alignment with a bounded number of gaps (Q2342666) (← links)
- Extending alignments with \(k\)-mismatches and \(\ell\)-gaps (Q2437749) (← links)
- On the average-case complexity of pattern matching with wildcards (Q2672571) (← links)
- Average-Case Optimal Approximate Circular String Matching (Q2799164) (← 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)
- On-Line Pattern Matching on Uncertain Sequences and Applications (Q2958345) (← links)
- Fast circular dictionary-matching algorithm (Q2971059) (← links)
- Linear-Time Computation of Prefix Table for Weighted Strings (Q3449358) (← links)
- (Q5369536) (← links)
- Fast Average-Case Pattern Matching on Weighted Sequences (Q5384623) (← links)
- Longest common prefixes with \(k\)-errors and applications (Q6109731) (← links)