{"id":"https://openalex.org/W2176155695","doi":"https://doi.org/10.1007/978-3-319-07566-2_20","title":"Efficient Algorithms for Shortest Partial Seeds in Words","display_name":"Efficient Algorithms for Shortest Partial Seeds in Words","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2176155695","doi":"https://doi.org/10.1007/978-3-319-07566-2_20","mag":"2176155695"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-07566-2_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-07566-2_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://kclpure.kcl.ac.uk/ws/files/63165111/Efficient_Algorithms_KOCIUMAKA_Accepted_GREEN_AAM.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086467798","display_name":"Tomasz Kociumaka","orcid":"https://orcid.org/0000-0002-2477-1702"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Tomasz Kociumaka","raw_affiliation_strings":["Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","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":["Department of Informatics, King\u2019s College London, London, WC2R 2LS, UK","Department of Informatics, King's College London, London, WC2R 2LS, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, King\u2019s College London, London, WC2R 2LS, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Department of Informatics, King's College London, London, WC2R 2LS, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082711976","display_name":"Jakub Radoszewski","orcid":"https://orcid.org/0000-0002-0067-6401"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Jakub Radoszewski","raw_affiliation_strings":["Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079957387","display_name":"Wojciech Rytter","orcid":"https://orcid.org/0000-0002-9162-6724"},"institutions":[{"id":"https://openalex.org/I3019271933","display_name":"Nicolaus Copernicus University","ror":"https://ror.org/0102mm775","country_code":"PL","type":"education","lineage":["https://openalex.org/I3019271933"]},{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Wojciech Rytter","raw_affiliation_strings":["Faculty of Mathematics and Computer Science, Copernicus University, Toru\u0144, Poland","Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics and Computer Science, Copernicus University, Toru\u0144, Poland","institution_ids":["https://openalex.org/I3019271933"]},{"raw_affiliation_string":"Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061843884","display_name":"Tomasz Wale\u0144","orcid":"https://orcid.org/0000-0002-7369-3309"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Tomasz Wale\u0144","raw_affiliation_strings":["Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":0.7242,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73469515,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"192","last_page":"201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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":0.9998999834060669,"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.9901999831199646,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9878000020980835,"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/cover","display_name":"Cover (algebra)","score":0.782496452331543},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.6975322365760803},{"id":"https://openalex.org/keywords/generalized-suffix-tree","display_name":"Generalized suffix tree","score":0.6634383201599121},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5955154895782471},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.5612582564353943},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5123094320297241},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.472523033618927},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.45442867279052734},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4441833198070526},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4327836036682129},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4278325140476227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4219190776348114},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.4194263815879822},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.24846118688583374},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06903177499771118}],"concepts":[{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.782496452331543},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.6975322365760803},{"id":"https://openalex.org/C118146561","wikidata":"https://www.wikidata.org/wiki/Q5532514","display_name":"Generalized suffix tree","level":4,"score":0.6634383201599121},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5955154895782471},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.5612582564353943},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5123094320297241},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.472523033618927},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.45442867279052734},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4441833198070526},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4327836036682129},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4278325140476227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4219190776348114},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.4194263815879822},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.24846118688583374},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06903177499771118},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-319-07566-2_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-07566-2_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/16905461-339c-4486-b01e-341ae52f466a","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/16905461-339c-4486-b01e-341ae52f466a","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/63165111/Efficient_Algorithms_KOCIUMAKA_Accepted_GREEN_AAM.pdf","source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kociumaka , T , Pissis , S , Radoszewski , J , Rytter , W & Wale\u0144 , T 2016 , ' Efficient algorithms for shortest partial seeds in words ' , Theoretical Computer Science . https://doi.org/10.1016/j.tcs.2016.11.035","raw_type":"article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/b72f39ae-fdd7-4084-926e-c2d3fd4acf54","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/b72f39ae-fdd7-4084-926e-c2d3fd4acf54","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kociumaka , T , Pissis , S P , Radoszewski , J , Rytter , W & Walen , T 2014 , Efficient Algorithms for Shortest Partial Seeds in Words . in A Kulikov , S Kuznetsov & P Pevzner (eds) , Combinatorial Pattern Matching : 25th Annual Symposium, CPM 2014, Moscow, Russia, June 16-18, 2014. Proceedings . Lecture Notes in Computer Science , vol. 8486 , pp. 192-201 , 25th Annual Symposium, CPM 2014 , Moscow , Russian Federation , 16/06/2014 . https://doi.org/10.1007/978-3-319-07566-2_20","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/16905461-339c-4486-b01e-341ae52f466a","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/16905461-339c-4486-b01e-341ae52f466a","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/63165111/Efficient_Algorithms_KOCIUMAKA_Accepted_GREEN_AAM.pdf","source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Kociumaka , T , Pissis , S , Radoszewski , J , Rytter , W & Wale\u0144 , T 2016 , ' Efficient algorithms for shortest partial seeds in words ' , Theoretical Computer Science . https://doi.org/10.1016/j.tcs.2016.11.035","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2176155695.pdf","grobid_xml":"https://content.openalex.org/works/W2176155695.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W63662079","https://openalex.org/W268246673","https://openalex.org/W642038236","https://openalex.org/W1496038746","https://openalex.org/W1515213620","https://openalex.org/W1609697921","https://openalex.org/W1992151876","https://openalex.org/W1995705893","https://openalex.org/W2011999472","https://openalex.org/W2030776771","https://openalex.org/W2056819372","https://openalex.org/W2056972845","https://openalex.org/W2084345246","https://openalex.org/W2121328026","https://openalex.org/W2145381651","https://openalex.org/W2730234337","https://openalex.org/W2952368020","https://openalex.org/W2953128905"],"related_works":["https://openalex.org/W96331545","https://openalex.org/W1517600056","https://openalex.org/W1575722140","https://openalex.org/W2036633468","https://openalex.org/W2160738675","https://openalex.org/W1548907175","https://openalex.org/W2003608043","https://openalex.org/W4293529780","https://openalex.org/W3022556214","https://openalex.org/W2405892617"],"abstract_inverted_index":{"A":[0,25],"factor":[1,26,63],"u":[2,22,27],"of":[3,10,21,31,38,41,50,57,87,122,128],"a":[4,8,29,36,39,54,62,66,73,102],"word":[5],"w":[6,11,16,32],"is":[7,28,35,104,157],"cover":[9,37],"if":[12,33,152],"every":[13],"position":[14],"in":[15,23,72,84,149],"lies":[17],"within":[18],"some":[19],"occurrence":[20],"w.":[24,42],"seed":[30,67],"it":[34,107],"superstring":[40],"Covers":[43],"and":[44,134],"seeds":[45,111,146],"extend":[46],"the":[47,78,85,129,135,153],"classical":[48],"notions":[49],"periodicity.":[51],"We":[52,76,138],"introduce":[53],"new":[55],"notion":[56],"\u03b1-partial":[58,88,145],"seed,":[59],"that":[60,109,147],"is,":[61],"covering":[64],"as":[65],"at":[68],"least":[69],"\u03b1":[70],"positions":[71],"given":[74],"word.":[75],"use":[77],"Cover":[79,131,154],"Suffix":[80,132,155],"Tree,":[81],"introduced":[82],"recently":[83],"context":[86],"covers":[89],"(Kociumaka":[90],"et":[91],"al,":[92],"CPM":[93],"2013);":[94],"an":[95,140],"$\\mathcal{O}(n\\log":[96],"n)$":[97],"-time":[98],"algorithm":[99,141],"constructing":[100],"such":[101],"tree":[103],"known.":[105],"However":[106],"appears":[108],"partial":[110,116],"are":[112],"more":[113],"complicated":[114],"than":[115],"covers\u2014our":[117],"algorithms":[118],"require":[119],"algebraic":[120],"manipulations":[121],"special":[123],"functions":[124],"related":[125],"to":[126],"edges":[127],"modified":[130],"Tree":[133,156],"border":[136],"array.":[137],"present":[139],"for":[142],"computing":[143],"shortest":[144],"works":[148],"$\\mathcal{O}(n)$":[150],"time":[151],"already":[158],"given.":[159]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}