| Fast algorithms for approximate circular string matching C Barton, CS Iliopoulos, SP Pissis Algorithms for Molecular Biology 9 (1), 1-10, 2014 | 39 | 2014 |
| Ageing-associated DNA methylation dynamics are a molecular readout of lifespan variation among mammalian species R Lowe, C Barton, CA Jenkins, C Ernst, O Forman, DS Fernandez-Twinn, ... Genome biology 19 (1), 1-8, 2018 | 30 | 2018 |
| Linear-time computation of minimal absent words using suffix array C Barton, A Heliou, L Mouchard, SP Pissis BMC bioinformatics 15 (1), 1-10, 2014 | 28 | 2014 |
| Efficient index for weighted sequences C Barton, T Kociumaka, SP Pissis, J Radoszewski arXiv preprint arXiv:1602.01116, 2016 | 24 | 2016 |
| Accurate and efficient methods to improve multiple circular sequence alignment C Barton, CS Iliopoulos, R Kundu, SP Pissis, A Retha, F Vayani International Symposium on Experimental Algorithms, 247-258, 2015 | 22 | 2015 |
| Average-case optimal approximate circular string matching C Barton, CS Iliopoulos, SP Pissis International conference on language and automata theory and applications, 85-96, 2015 | 21 | 2015 |
| Indexing weighted sequences: neat and efficient C Barton, T Kociumaka, C Liu, SP Pissis, J Radoszewski Information and Computation 270, 104462, 2020 | 19 | 2020 |
| Longest Common Prefixes with k-Errors and Applications LAK Ayad, C Barton, P Charalampopoulos, CS Iliopoulos, SP Pissis International Symposium on String Processing and Information Retrieval, 27-41, 2018 | 15 | 2018 |
| Optimal computation of all tandem repeats in a weighted sequence C Barton, CS Iliopoulos, SP Pissis Algorithms for Molecular Biology 9 (1), 1-8, 2014 | 15 | 2014 |
| Parallelising the computation of minimal absent words C Barton, A Héliou, L Mouchard, SP Pissis Parallel Processing and Applied Mathematics, 243-253, 2016 | 14 | 2016 |
| Fast circular dictionary-matching algorithm T Athar, C Barton, JIA GAO, CS ILIOPOULOS, C LIU, SP PISSIS Mathematical Structures in Computer Science 27 (2), 143-156, 2017 | 12 | 2017 |
| Linear-time computation of prefix table for weighted strings & applications C Barton, C Liu, SP Pissis Theoretical Computer Science 656, 160-172, 2016 | 12 | 2016 |
| On-line pattern matching on uncertain sequences and applications C Barton, C Liu, SP Pissis International Conference on Combinatorial Optimization and Applications, 547-562, 2016 | 12 | 2016 |
| Crochemore’s partitioning on weighted strings and applications C Barton, SP Pissis Algorithmica 80 (2), 496-514, 2018 | 10 | 2018 |
| A faster and more accurate heuristic for cyclic edit distance computation LAK Ayad, C Barton, SP Pissis Pattern Recognition Letters 88, 81-87, 2017 | 10 | 2017 |
| Fast and simple computations using prefix tables under hamming and edit distance C Barton, CS Iliopoulos, SP Pissis, WF Smyth International Workshop on Combinatorial Algorithms, 49-61, 2014 | 10 | 2014 |
| GapsMis: flexible sequence alignment with a bounded number of gaps C Barton, T Flouri, CS Iliopoulos, SP Pissis Proceedings of the International Conference on Bioinformatics, Computational …, 2013 | 10 | 2013 |
| Linear-time computation of prefix table for weighted strings C Barton, SP Pissis International Conference on Combinatorics on Words, 73-84, 2015 | 9 | 2015 |
| Querying highly similar structured sequences via binary encoding and word level operations A Alatabbi, C Barton, CS Iliopoulos, L Mouchard IFIP International Conference on Artificial Intelligence Applications and …, 2012 | 8 | 2012 |
| Global and local sequence alignment with a bounded number of gaps C Barton, T Flouri, CS Iliopoulos, SP Pissis Theoretical Computer Science 582, 1-16, 2015 | 7 | 2015 |
