{"id":"https://openalex.org/W2044074710","doi":"https://doi.org/10.1186/1748-7188-9-9","title":"Fast algorithms for approximate circular string matching","display_name":"Fast algorithms for approximate circular string matching","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2044074710","doi":"https://doi.org/10.1186/1748-7188-9-9","mag":"2044074710","pmid":"https://pubmed.ncbi.nlm.nih.gov/24656145"},"language":"en","primary_location":{"id":"doi:10.1186/1748-7188-9-9","is_oa":true,"landing_page_url":"https://doi.org/10.1186/1748-7188-9-9","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/1748-7188-9-9","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj","pubmed"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/1748-7188-9-9","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102952570","display_name":"Carl Barton","orcid":"https://orcid.org/0000-0003-1589-0432"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Carl Barton","raw_affiliation_strings":["King's College London, London, UK","King \u2018s College London"],"affiliations":[{"raw_affiliation_string":"King's College London, London, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"King \u2018s College London","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058155947","display_name":"Costas S. Iliopoulos","orcid":"https://orcid.org/0000-0003-3909-0077"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"The University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]},{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]},{"id":"https://openalex.org/I205640436","display_name":"Curtin University","ror":"https://ror.org/02n415q13","country_code":"AU","type":"education","lineage":["https://openalex.org/I205640436"]}],"countries":["AU","GB"],"is_corresponding":false,"raw_author_name":"Costas S Iliopoulos","raw_affiliation_strings":["Curtin University, Bentley, Australia","King\u2019s College London, London, UK","University of Western Australia, Crawley, Australia"],"affiliations":[{"raw_affiliation_string":"Curtin University, Bentley, Australia","institution_ids":["https://openalex.org/I205640436"]},{"raw_affiliation_string":"King\u2019s College London, London, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"University of Western Australia, Crawley, Australia","institution_ids":["https://openalex.org/I177877127"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051275317","display_name":"Solon P. Pissis","orcid":"https://orcid.org/0000-0002-1445-1932"},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Solon P Pissis","raw_affiliation_strings":["King's College London, London, UK. solon.pissis@kcl.ac.uk","King's College London, London, UK"],"affiliations":[{"raw_affiliation_string":"King's College London, London, UK. solon.pissis@kcl.ac.uk","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"King's College London, London, UK","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5102952570"],"corresponding_institution_ids":["https://openalex.org/I183935753"],"apc_list":{"value":1490,"currency":"GBP","value_usd":1827},"apc_paid":{"value":1490,"currency":"GBP","value_usd":1827},"fwci":9.3029,"has_fulltext":true,"cited_by_count":33,"citation_normalized_percentile":{"value":0.97924697,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"9","issue":"1","first_page":"9","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.8180013298988342},{"id":"https://openalex.org/keywords/approximate-string-matching","display_name":"Approximate string matching","score":0.7244880199432373},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.7092677354812622},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6331843137741089},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6295390725135803},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6223472356796265},{"id":"https://openalex.org/keywords/string-metric","display_name":"String metric","score":0.6111029982566833},{"id":"https://openalex.org/keywords/commentz-walter-algorithm","display_name":"Commentz-Walter algorithm","score":0.6108393669128418},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.5827516913414001},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5362713932991028},{"id":"https://openalex.org/keywords/pipeline","display_name":"Pipeline (software)","score":0.5170196294784546},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.4982600212097168},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.48219648003578186},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3120630383491516},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09701421856880188},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06327518820762634}],"concepts":[{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.8180013298988342},{"id":"https://openalex.org/C32610155","wikidata":"https://www.wikidata.org/wiki/Q1798621","display_name":"Approximate string matching","level":3,"score":0.7244880199432373},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.7092677354812622},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6331843137741089},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6295390725135803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6223472356796265},{"id":"https://openalex.org/C22820288","wikidata":"https://www.wikidata.org/wiki/Q9050568","display_name":"String metric","level":4,"score":0.6111029982566833},{"id":"https://openalex.org/C13052355","wikidata":"https://www.wikidata.org/wiki/Q5152399","display_name":"Commentz-Walter algorithm","level":4,"score":0.6108393669128418},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.5827516913414001},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5362713932991028},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.5170196294784546},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.4982600212097168},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.48219648003578186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3120630383491516},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09701421856880188},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06327518820762634},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1186/1748-7188-9-9","is_oa":true,"landing_page_url":"https://doi.org/10.1186/1748-7188-9-9","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/1748-7188-9-9","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},{"id":"pmid:24656145","is_oa":false,"landing_page_url":"https://pubmed.ncbi.nlm.nih.gov/24656145","pdf_url":null,"source":{"id":"https://openalex.org/S4306525036","display_name":"PubMed","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for molecular biology : AMB","raw_type":null},{"id":"pmh:oai:kclpure.kcl.ac.uk:openaire/58810ebc-1b8e-48ae-873d-d8412bca4120","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/58810ebc-1b8e-48ae-873d-d8412bca4120","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Barton, C, Iliopoulos, C S & Pissis, S P 2014, 'Fast Algorithms for Approximate Circular String Matching', Algorithms for Molecular Biology, vol. 9, 9. https://doi.org/10.1186/1748-7188-9-9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:openaire/302649f6-8bcf-409d-9463-dec4cf75f275","is_oa":true,"landing_page_url":"https://admin.research-repository.uwa.edu.au/en/publications/302649f6-8bcf-409d-9463-dec4cf75f275","pdf_url":null,"source":{"id":"https://openalex.org/S4306402492","display_name":"UWA Profiles and Research Repository (UWA)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Barton, C, Iliopoulos, C & Pissis, S P 2014, 'Fast algorithms for approximate circular string matching', Algorithms for Molecular Biology, vol. 9, no. 1, pp. 10pp. https://doi.org/10.1186/1748-7188-9-9","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.atira.dk:publications/302649f6-8bcf-409d-9463-dec4cf75f275","is_oa":true,"landing_page_url":"https://research-repository.uwa.edu.au/en/publications/302649f6-8bcf-409d-9463-dec4cf75f275","pdf_url":null,"source":{"id":"https://openalex.org/S4306402523","display_name":"UWA Profiles and Research Repository (University of Western Australia)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177877127","host_organization_name":"The University of Western Australia","host_organization_lineage":["https://openalex.org/I177877127"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Barton , C , Iliopoulos , C & Pissis , S P 2014 , ' Fast algorithms for approximate circular string matching ' , Algorithms for Molecular Biology , vol. 9 , no. 1 , pp. 10pp . https://doi.org/10.1186/1748-7188-9-9","raw_type":"article"},{"id":"pmh:oai:espace.curtin.edu.au:20.500.11937/21124","is_oa":false,"landing_page_url":"http://hdl.handle.net/20.500.11937/21124","pdf_url":null,"source":{"id":"https://openalex.org/S4306401790","display_name":"eSpace (Curtin University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205640436","host_organization_name":"Curtin University","host_organization_lineage":["https://openalex.org/I205640436"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"},{"id":"pmh:oai:europepmc.org:3203305","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/4234210","pdf_url":null,"source":{"id":"https://openalex.org/S4306400806","display_name":"Europe PMC (PubMed Central)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1303153112","host_organization_name":"European Bioinformatics Institute","host_organization_lineage":["https://openalex.org/I1303153112"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":{"id":"doi:10.1186/1748-7188-9-9","is_oa":true,"landing_page_url":"https://doi.org/10.1186/1748-7188-9-9","pdf_url":"https://almob.biomedcentral.com/counter/pdf/10.1186/1748-7188-9-9","source":{"id":"https://openalex.org/S205663195","display_name":"Algorithms for Molecular Biology","issn_l":"1748-7188","issn":["1748-7188"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320256","host_organization_name":"BioMed Central","host_organization_lineage":["https://openalex.org/P4310320256","https://openalex.org/P4310319965"],"host_organization_lineage_names":["BioMed Central","Springer Nature"],"type":"journal"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms for Molecular Biology","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4515810461","display_name":"DTA - King's College London","funder_award_id":"EP/J500252/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7152236099","display_name":null,"funder_award_id":"#EP/J500252/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7668322710","display_name":null,"funder_award_id":"Doctoral Training Grant","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320285","display_name":"King's College London","ror":"https://ror.org/0220mzb33"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2044074710.pdf","grobid_xml":"https://content.openalex.org/works/W2044074710.grobid-xml"},"referenced_works_count":36,"referenced_works":["https://openalex.org/W82544137","https://openalex.org/W200764996","https://openalex.org/W620420907","https://openalex.org/W938539187","https://openalex.org/W1504417041","https://openalex.org/W1520663999","https://openalex.org/W1559776438","https://openalex.org/W1579210880","https://openalex.org/W1584653951","https://openalex.org/W1964638897","https://openalex.org/W1970026646","https://openalex.org/W1972883744","https://openalex.org/W1987426253","https://openalex.org/W1991673591","https://openalex.org/W2002246332","https://openalex.org/W2007791040","https://openalex.org/W2027400096","https://openalex.org/W2029803875","https://openalex.org/W2031462867","https://openalex.org/W2045821558","https://openalex.org/W2066846592","https://openalex.org/W2073914876","https://openalex.org/W2098102002","https://openalex.org/W2112777598","https://openalex.org/W2121569737","https://openalex.org/W2121676416","https://openalex.org/W2139749722","https://openalex.org/W2141208059","https://openalex.org/W2155631901","https://openalex.org/W2155751070","https://openalex.org/W2165654401","https://openalex.org/W2168401659","https://openalex.org/W2610179052","https://openalex.org/W2911550701","https://openalex.org/W2951775526","https://openalex.org/W4254652536"],"related_works":["https://openalex.org/W2257399947","https://openalex.org/W2399644331","https://openalex.org/W52396946","https://openalex.org/W2599240737","https://openalex.org/W2044074710","https://openalex.org/W2183021612","https://openalex.org/W1994727264","https://openalex.org/W1990169993","https://openalex.org/W1499807604","https://openalex.org/W2180648128"],"abstract_inverted_index":{"We":[0],"present":[1],"two":[2],"fast":[3],"average-case":[4],"algorithms":[5],"for":[6],"approximate":[7],"circular":[8],"string":[9],"matching":[10],"with":[11],"k-mismatches;":[12],"and":[13],"show":[14],"that":[15,33],"they":[16],"also":[17],"perform":[18],"very":[19],"well":[20],"in":[21],"practice.":[22],"The":[23,45],"importance":[24],"of":[25,48],"our":[26],"contribution":[27],"is":[28,51],"underlined":[29],"by":[30],"the":[31,34,49],"fact":[32],"provided":[35],"functions":[36],"may":[37],"be":[38],"seamlessly":[39],"integrated":[40],"into":[41],"any":[42],"biological":[43],"pipeline.":[44],"source":[46],"code":[47],"library":[50],"freely":[52],"available":[53],"at":[54],"http://www.inf.kcl.ac.uk/research/projects/asmf/.":[55]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":3}],"updated_date":"2026-04-12T07:58:50.170612","created_date":"2025-10-10T00:00:00"}