Carl Barton

Orcid: 0000-0001-6938-9446

According to our database1, Carl Barton authored at least 31 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A novel hierarchy-based knowledge discovery framework for elucidating human aging-related phenotypic abnormalities.
Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing, 2024

2022
On the average-case complexity of pattern matching with wildcards.
Theor. Comput. Sci., 2022

2020
Indexing weighted sequences: Neat and efficient.
Inf. Comput., 2020

2018
ChromoTrace: Computational reconstruction of 3D chromosome configurations for super-resolution microscopy.
PLoS Comput. Biol., 2018

Fast Average-Case Pattern Matching on Weighted Sequences.
Int. J. Found. Comput. Sci., 2018

Crochemore's Partitioning on Weighted Strings and Applications.
Algorithmica, 2018

Longest Common Prefixes with k-Errors and Applications.
Proceedings of the String Processing and Information Retrieval, 2018

2017
A faster and more accurate heuristic for cyclic edit distance computation.
Pattern Recognit. Lett., 2017

Fast circular dictionary-matching algorithm.
Math. Struct. Comput. Sci., 2017

2016
Linear-time computation of prefix table for weighted strings & applications.
Theor. Comput. Sci., 2016

Efficient Index for Weighted Sequences.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

On-Line Pattern Matching on Uncertain Sequences and Applications.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Global and local sequence alignment with a bounded number of gaps.
Theor. Comput. Sci., 2015

Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015

Parallelising the Computation of Minimal Absent Words.
Proceedings of the Parallel Processing and Applied Mathematics, 2015

Average-Case Optimal Approximate Circular String Matching.
Proceedings of the Language and Automata Theory and Applications, 2015

Linear-Time Computation of Prefix Table for Weighted Strings.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014
Extending alignments with k-mismatches and ℓ-gaps.
Theor. Comput. Sci., 2014

On the Average-case Complexity of Pattern Matching with Wildcards.
CoRR, 2014

Linear-time computation of minimal absent words using suffix array.
BMC Bioinform., 2014

Optimal computation of all tandem repeats in a weighted sequence.
Algorithms Mol. Biol., 2014

Fast algorithms for approximate circular string matching.
Algorithms Mol. Biol., 2014

Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

Optimal Computation of all Repetitions in a Weighted String.
Proceedings of the 2nd International Conference on Algorithms for Big Data , 2014

2013
Querying highly similar sequences.
Int. J. Comput. Biol. Drug Des., 2013

Identification of All Exact and Approximate Inverted Repeats in Regular and Weighted Sequences.
Proceedings of the Engineering Applications of Neural Networks, 2013

GapsMis: flexible sequence alignment with a bounded number of gaps.
Proceedings of the ACM Conference on Bioinformatics, 2013

2012
Conceptualization and Significance Study of a New Appliation CS-MIR.
Proceedings of the Artificial Intelligence Applications and Innovations, 2012

Melodic String Matching via Interval Consolidation and Fragmentation.
Proceedings of the Artificial Intelligence Applications and Innovations, 2012

Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations.
Proceedings of the Artificial Intelligence Applications and Innovations, 2012

On the repetitive collection indexing problem.
Proceedings of the 2012 IEEE International Conference on Bioinformatics and Biomedicine Workshops, 2012


  Loading...