default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarl Barton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Cen Wan
, Carl Barton:
A novel hierarchy-based knowledge discovery framework for elucidating human aging-related phenotypic abnormalities. SAC 2024: 515-522- 2022
- [j14]Carl Barton:
On the average-case complexity of pattern matching with wildcards. Theor. Comput. Sci. 922: 37-45 (2022) - 2020
- [j13]Carl Barton, Tomasz Kociumaka, Chang Liu, Solon P. Pissis, Jakub Radoszewski:
Indexing weighted sequences: Neat and efficient. Inf. Comput. 270 (2020)
2010 – 2019
- 2018
- [j12]Carl Barton, Solon P. Pissis:
Crochemore's Partitioning on Weighted Strings and Applications. Algorithmica 80(2): 496-514 (2018) - [j11]Carl Barton, Chang Liu, Solon P. Pissis:
Fast Average-Case Pattern Matching on Weighted Sequences. Int. J. Found. Comput. Sci. 29(8): 1331-1343 (2018) - [j10]Carl Barton, Sandro Morganella, Øyvind Ødegård-Fougner, Stephanie Alexander, Jonas Ries, Tomas W. Fitzgerald, Jan Ellenberg, Ewan Birney:
ChromoTrace: Computational reconstruction of 3D chromosome configurations for super-resolution microscopy. PLoS Comput. Biol. 14(3) (2018) - [c15]Lorraine A. K. Ayad, Carl Barton, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
Longest Common Prefixes with k-Errors and Applications. SPIRE 2018: 27-41 - 2017
- [j9]Tanver Athar, Carl Barton, Widmer Bland, Jia Gao, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Fast circular dictionary-matching algorithm. Math. Struct. Comput. Sci. 27(2): 143-156 (2017) - [j8]Lorraine A. K. Ayad, Carl Barton, Solon P. Pissis:
A faster and more accurate heuristic for cyclic edit distance computation. Pattern Recognit. Lett. 88: 81-87 (2017) - [i6]Carl Barton, Tomasz Kociumaka, Chang Liu, Solon P. Pissis, Jakub Radoszewski:
Indexing Weighted Sequences: Neat and Efficient. CoRR abs/1704.07625 (2017) - 2016
- [j7]Carl Barton, Chang Liu, Solon P. Pissis:
Linear-time computation of prefix table for weighted strings & applications. Theor. Comput. Sci. 656: 160-172 (2016) - [c14]Carl Barton, Chang Liu, Solon P. Pissis:
On-Line Pattern Matching on Uncertain Sequences and Applications. COCOA 2016: 547-562 - [c13]Carl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Efficient Index for Weighted Sequences. CPM 2016: 4:1-4:13 - [i5]Carl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Efficient Index for Weighted Sequences. CoRR abs/1602.01116 (2016) - 2015
- [j6]Carl Barton, Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis:
Global and local sequence alignment with a bounded number of gaps. Theor. Comput. Sci. 582: 1-16 (2015) - [c12]Carl Barton, Solon P. Pissis:
Linear-Time Computation of Prefix Table for Weighted Strings. WORDS 2015: 73-84 - [c11]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Average-Case Optimal Approximate Circular String Matching. LATA 2015: 85-96 - [c10]Carl Barton, Alice Héliou, Laurent Mouchard, Solon P. Pissis:
Parallelising the Computation of Minimal Absent Words. PPAM (2) 2015: 243-253 - [c9]Carl Barton, Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment. SEA 2015: 247-258 - [i4]Carl Barton, Chang Liu, Solon P. Pissis:
Fast Average-Case Pattern Matching on Weighted Sequences. CoRR abs/1512.01085 (2015) - 2014
- [j5]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Fast algorithms for approximate circular string matching. Algorithms Mol. Biol. 9: 9 (2014) - [j4]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Optimal computation of all tandem repeats in a weighted sequence. Algorithms Mol. Biol. 9: 21 (2014) - [j3]Carl Barton, Alice Héliou, Laurent Mouchard, Solon P. Pissis:
Linear-time computation of minimal absent words using suffix array. BMC Bioinform. 15: 388 (2014) - [j2]Carl Barton, Costas S. Iliopoulos, Inbok Lee, Laurent Mouchard, Kunsoo Park, Solon P. Pissis:
Extending alignments with k-mismatches and ℓ-gaps. Theor. Comput. Sci. 525: 80-88 (2014) - [c8]Carl Barton, Solon P. Pissis:
Optimal Computation of all Repetitions in a Weighted String. ICABD 2014: 9-15 - [c7]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis, William F. Smyth:
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance. IWOCA 2014: 49-61 - [i3]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Average-Case Optimal Approximate Circular String Matching. CoRR abs/1406.5480 (2014) - [i2]Carl Barton, Alice Héliou, Laurent Mouchard, Solon P. Pissis:
Linear-time Computation of Minimal Absent Words Using Suffix Array. CoRR abs/1406.6341 (2014) - [i1]Carl Barton, Costas S. Iliopoulos:
On the Average-case Complexity of Pattern Matching with Wildcards. CoRR abs/1407.0950 (2014) - 2013
- [j1]Carl Barton, Mathieu Giraud, Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard, Solon P. Pissis:
Querying highly similar sequences. Int. J. Comput. Biol. Drug Des. 6(1/2): 119-130 (2013) - [c6]Carl Barton, Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis:
GapsMis: flexible sequence alignment with a bounded number of gaps. BCB 2013: 402 - [c5]Carl Barton, Costas S. Iliopoulos, Nicola J. Mulder, Bruce W. Watson:
Identification of All Exact and Approximate Inverted Repeats in Regular and Weighted Sequences. EANN (2) 2013: 11-19 - 2012
- [c4]Ali Alatabbi, Carl Barton, Costas S. Iliopoulos:
On the repetitive collection indexing problem. BIBM Workshops 2012: 682-687 - [c3]Kaichun K. Chang, Carl Barton, Costas S. Iliopoulos, Jyh-Shing Roger Jang:
Conceptualization and Significance Study of a New Appliation CS-MIR. AIAI (1) 2012: 146-156 - [c2]Carl Barton, Emilios Cambouropoulos, Costas S. Iliopoulos, Zsuzsanna Lipták:
Melodic String Matching via Interval Consolidation and Fragmentation. AIAI (2) 2012: 460-469 - [c1]Ali Alatabbi, Carl Barton, Costas S. Iliopoulos, Laurent Mouchard:
Querying Highly Similar Structured Sequences via Binary Encoding and Word Level Operations. AIAI (2) 2012: 584-592
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 00:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
