{"id":"https://openalex.org/W2076953942","doi":"https://doi.org/10.1142/s0129054112400199","title":"CROCHEMORE'S REPETITIONS ALGORITHM REVISITED: COMPUTING RUNS","display_name":"CROCHEMORE'S REPETITIONS ALGORITHM REVISITED: COMPUTING RUNS","publication_year":2012,"publication_date":"2012-02-01","ids":{"openalex":"https://openalex.org/W2076953942","doi":"https://doi.org/10.1142/s0129054112400199","mag":"2076953942"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054112400199","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054112400199","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025523396","display_name":"Franti\u0161ek Fran\u011bk","orcid":"https://orcid.org/0000-0002-4110-2113"},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"FRANTISEK FRANEK","raw_affiliation_strings":["Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1, Canada","Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1, Canada","institution_ids":["https://openalex.org/I98251732"]},{"raw_affiliation_string":"Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1, Canada#TAB#","institution_ids":["https://openalex.org/I98251732"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056536691","display_name":"Mei Jiang","orcid":"https://orcid.org/0000-0002-3184-3209"},"institutions":[{"id":"https://openalex.org/I98251732","display_name":"McMaster University","ror":"https://ror.org/02fa3aq29","country_code":"CA","type":"education","lineage":["https://openalex.org/I98251732"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"MEI JIANG","raw_affiliation_strings":["Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1, Canada","Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1, Canada","institution_ids":["https://openalex.org/I98251732"]},{"raw_affiliation_string":"Department of Computing and Software, McMaster University, Hamilton, Ontario, L8S 4K1, Canada#TAB#","institution_ids":["https://openalex.org/I98251732"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I98251732"],"apc_list":null,"apc_paid":null,"fwci":0.4349,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73092796,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"23","issue":"02","first_page":"389","last_page":"401"},"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/T11567","display_name":"semigroups and automata theory","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11130","display_name":"Coding theory and cryptography","score":0.9621999859809875,"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/algorithm","display_name":"Algorithm","score":0.672609806060791},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6253238916397095},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.6216698884963989},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.603308916091919},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.6023032665252686},{"id":"https://openalex.org/keywords/suffix-array","display_name":"Suffix array","score":0.5957146883010864},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5730730295181274},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.533256471157074},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5194689631462097},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.5168219208717346},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.41586366295814514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33916300535202026},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.3026273250579834}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.672609806060791},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6253238916397095},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.6216698884963989},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.603308916091919},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.6023032665252686},{"id":"https://openalex.org/C2779259728","wikidata":"https://www.wikidata.org/wiki/Q281472","display_name":"Suffix array","level":3,"score":0.5957146883010864},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5730730295181274},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.533256471157074},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5194689631462097},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.5168219208717346},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.41586366295814514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33916300535202026},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.3026273250579834},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054112400199","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054112400199","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W117230746","https://openalex.org/W1504417041","https://openalex.org/W1528544059","https://openalex.org/W1588721702","https://openalex.org/W2007378578","https://openalex.org/W2014277465","https://openalex.org/W2067675443","https://openalex.org/W2067787802","https://openalex.org/W2088672239","https://openalex.org/W2107079154","https://openalex.org/W2130564474","https://openalex.org/W2134283755","https://openalex.org/W2158874082","https://openalex.org/W2533248932","https://openalex.org/W4254652536"],"related_works":["https://openalex.org/W2003608043","https://openalex.org/W153119118","https://openalex.org/W2583658747","https://openalex.org/W2405892617","https://openalex.org/W1486336060","https://openalex.org/W2158874082","https://openalex.org/W1575722140","https://openalex.org/W4293529780","https://openalex.org/W1498395615","https://openalex.org/W2073921136"],"abstract_inverted_index":{"Crochemore's":[0,71,90,121,199],"repetitions":[1,72,122,134],"algorithm":[2,12,73,91,123,135,200],"introduced":[3],"in":[4,66],"1981":[5],"was":[6],"the":[7,36,43,50,55,60,76,98,119,133,154,158,195],"first":[8,34],"O(n":[9,145],"log":[10,147],"n)":[11,148],"for":[13,22,82,166,183,201],"computing":[14,23],"repetitions.":[15],"Since":[16],"then,":[17],"several":[18],"linear-time":[19,77,99],"worst-case":[20],"algorithms":[21,100],"runs":[24],"have":[25],"been":[26],"introduced.":[27],"They":[28],"all":[29,59,108],"follow":[30],"a":[31,141],"similar":[32],"strategy:":[33],"compute":[35,49,58,125,137],"suffix":[37,44],"tree":[38,45],"or":[39,46,79],"array,":[40],"then":[41,53],"use":[42],"array":[47],"to":[48,95,105,114,117,124,136,193],"Lempel-Ziv":[51,56],"factorization,":[52],"using":[54],"factorization":[57],"runs.":[61,126],"It":[62],"is":[63,112,179,192],"conceivable":[64],"that":[65],"practice":[67],"an":[68],"extension":[69,197],"of":[70,85,89,131,144,168,189,198],"may":[74],"outperform":[75],"algorithms,":[78,207],"at":[80],"least":[81],"certain":[83],"classes":[84],"strings.":[86],"The":[87,161,176,187],"nature":[88],"lends":[92],"itself":[93],"naturally":[94],"parallelization,":[96],"while":[97],"are":[101,164,174],"not":[102],"easily":[103],"conducive":[104],"parallelization.":[106],"For":[107],"these":[109],"reasons":[110],"it":[111],"interesting":[113],"explore":[115],"ways":[116],"extend":[118],"original":[120,159],"We":[127],"present":[128],"three":[129,162],"variants":[130,163],"extending":[132],"runs:":[138],"two":[139],"with":[140,153,205],"worsen":[142],"complexity":[143,156],"(":[146],"2":[149],"),":[150],"and":[151,170,181,208],"one":[152],"same":[155],"as":[157],"algorithm.":[160],"tested":[165,180],"speed":[167],"performance":[169],"their":[171],"memory":[172],"requirements":[173],"analyzed.":[175],"third":[177],"variant":[178],"analyzed":[182],"various":[184],"memory-saving":[185],"alterations.":[186],"purpose":[188],"this":[190],"research":[191],"identify":[194],"best":[196],"further":[202],"study,":[203],"comparison":[204],"other":[206],"parallel":[209],"implementation.":[210]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}