{"id":"https://openalex.org/W2066688923","doi":"https://doi.org/10.1137/s0097539793246707","title":"Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance","display_name":"Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance","publication_year":1997,"publication_date":"1997-10-01","ids":{"openalex":"https://openalex.org/W2066688923","doi":"https://doi.org/10.1137/s0097539793246707","mag":"2066688923"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793246707","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793246707","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5108392571","display_name":"Brenda S. Baker","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Brenda S. Baker","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5108392571"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3942,"has_fulltext":false,"cited_by_count":159,"citation_normalized_percentile":{"value":0.89764622,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"26","issue":"5","first_page":"1343","last_page":"1362"},"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9991000294685364,"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/T12016","display_name":"Web Data Mining and Analysis","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/parameterized-complexity","display_name":"Parameterized complexity","score":0.9488508105278015},{"id":"https://openalex.org/keywords/suffix-tree","display_name":"Suffix tree","score":0.6662815809249878},{"id":"https://openalex.org/keywords/identifier","display_name":"Identifier","score":0.6440396904945374},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.6319510340690613},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6163090467453003},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5840262770652771},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5273462533950806},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5165192484855652},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4596386253833771},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.450792133808136},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.43207675218582153},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4218778908252716},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3693697452545166},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3581603169441223},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19632583856582642},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.157221257686615},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1256297528743744}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.9488508105278015},{"id":"https://openalex.org/C2781166958","wikidata":"https://www.wikidata.org/wiki/Q1426863","display_name":"Suffix tree","level":3,"score":0.6662815809249878},{"id":"https://openalex.org/C154504017","wikidata":"https://www.wikidata.org/wiki/Q853614","display_name":"Identifier","level":2,"score":0.6440396904945374},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.6319510340690613},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6163090467453003},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5840262770652771},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5273462533950806},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5165192484855652},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4596386253833771},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.450792133808136},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.43207675218582153},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4218778908252716},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3693697452545166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3581603169441223},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19632583856582642},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.157221257686615},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1256297528743744},{"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},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539793246707","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793246707","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.130.6293","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.130.6293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://juankm702.googlepages.com/parameterizedduplicationinstringsalg.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320327604","display_name":"Akershus Universitetssykehus","ror":"https://ror.org/0331wat71"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1964169783","https://openalex.org/W1974930421","https://openalex.org/W1981320868","https://openalex.org/W1997953464","https://openalex.org/W2012170877","https://openalex.org/W2028249034","https://openalex.org/W2045821558","https://openalex.org/W2055417893","https://openalex.org/W2059513841","https://openalex.org/W2120555900","https://openalex.org/W2121252285","https://openalex.org/W2155843307","https://openalex.org/W2533248932","https://openalex.org/W3151756653","https://openalex.org/W4244527929","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W96331545","https://openalex.org/W2073921136","https://openalex.org/W2583658747","https://openalex.org/W2160738675","https://openalex.org/W2405892617","https://openalex.org/W1548907175","https://openalex.org/W3022556214","https://openalex.org/W2396668937","https://openalex.org/W1498395615","https://openalex.org/W2003608043"],"abstract_inverted_index":{"As":[0],"an":[1],"aid":[2,82],"in":[3,17,23,27,55,83,100,114,118,121],"software":[4,19],"maintenance,":[5],"it":[6],"would":[7],"be":[8,11],"useful":[9],"to":[10,13,81,94,104],"able":[12],"track":[14],"down":[15],"duplication":[16,54],"large":[18],"systems":[20],"efficiently.":[21],"Duplication":[22],"code":[24,33],"is":[25,79],"often":[26],"the":[28,36,60,122,125,128],"form":[29],"of":[30,32,43,62,68,124,130],"sections":[31],"that":[34,142],"are":[35,92],"same":[37],"except":[38],"for":[39,85],"a":[40,75,96,111,115],"systematic":[41],"change":[42],"parameters":[44],"such":[45,52],"as":[46],"identifiers":[47],"and":[48,65,103,138],"constants.":[49],"To":[50],"model":[51],"parameterized":[53,63,66,69,76,86,97,108,116],"code,":[56],"this":[57],"paper":[58],"introduces":[59],"notions":[61],"strings":[64],"matches":[67,109,131],"strings.":[70],"A":[71],"data":[72],"structure":[73],"called":[74],"suffix":[77,98],"tree":[78,99],"defined":[80],"searching":[84],"matches.":[87],"For":[88],"fixed":[89],"alphabets,":[90],"algorithms":[91,134],"given":[93],"construct":[95],"linear":[101,120],"time":[102,119],"find":[105],"all":[106],"maximal":[107],"over":[110],"threshold":[112],"length":[113],"p-string":[117],"size":[123],"input":[126],"plus":[127],"number":[129],"reported.":[132],"The":[133],"have":[135],"been":[136],"implemented,":[137],"experimental":[139],"results":[140],"show":[141],"they":[143],"perform":[144],"well":[145],"on":[146],"C":[147],"code.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}