Carl Barton

Available identifiers

Publication	Date of Publication	Type
Longest common prefixes with \(k\)-errors and applications	2023-07-28	Paper
On the average-case complexity of pattern matching with wildcards	2022-06-13	Paper
Indexing weighted sequences: neat and efficient	2020-01-17	Paper
Fast Average-Case Pattern Matching on Weighted Sequences	2019-06-24	Paper
Crochemore's partitioning on weighted strings and applications	2018-04-06	Paper
https://portal.mardi4nfdi.de/entity/Q5369536	2017-10-17	Paper
Fast circular dictionary-matching algorithm	2017-04-04	Paper
Linear-time computation of prefix table for weighted strings {\&} applications	2017-02-06	Paper
On-Line Pattern Matching on Uncertain Sequences and Applications	2017-02-01	Paper
Average-Case Optimal Approximate Circular String Matching	2016-04-08	Paper
Linear-Time Computation of Prefix Table for Weighted Strings	2015-11-04	Paper
Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment	2015-09-30	Paper
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance	2015-09-15	Paper
Global and local sequence alignment with a bounded number of gaps	2015-04-29	Paper
Extending alignments with \(k\)-mismatches and \(\ell\)-gaps	2014-03-13	Paper

This page was built for person: Carl Barton