{"id":"https://openalex.org/W2118596993","doi":"https://doi.org/10.1109/vlhcc.2012.6344471","title":"Planted-model evaluation of algorithms for identifying differences between spreadsheets","display_name":"Planted-model evaluation of algorithms for identifying differences between spreadsheets","publication_year":2012,"publication_date":"2012-09-01","ids":{"openalex":"https://openalex.org/W2118596993","doi":"https://doi.org/10.1109/vlhcc.2012.6344471","mag":"2118596993"},"language":"en","primary_location":{"id":"doi:10.1109/vlhcc.2012.6344471","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vlhcc.2012.6344471","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)","raw_type":"proceedings-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/A5112471787","display_name":"A. V. Harutyunyan","orcid":null},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A. Harutyunyan","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA","[School of Electrical Engineering & Computer Science, Oregon State University, Corvallis, USA]"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA","institution_ids":["https://openalex.org/I131249849"]},{"raw_affiliation_string":"[School of Electrical Engineering & Computer Science, Oregon State University, Corvallis, USA]","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108529502","display_name":"Glencora Borradaile","orcid":null},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"G. Borradaile","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA","[School of Electrical Engineering & Computer Science, Oregon State University, Corvallis, USA]"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA","institution_ids":["https://openalex.org/I131249849"]},{"raw_affiliation_string":"[School of Electrical Engineering & Computer Science, Oregon State University, Corvallis, USA]","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046775343","display_name":"Carol L. Chambers","orcid":"https://orcid.org/0000-0002-2524-4672"},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Chambers","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA","[School of Electrical Engineering & Computer Science, Oregon State University, Corvallis, USA]"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA","institution_ids":["https://openalex.org/I131249849"]},{"raw_affiliation_string":"[School of Electrical Engineering & Computer Science, Oregon State University, Corvallis, USA]","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113462592","display_name":"Chris Scaffidi","orcid":null},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Scaffidi","raw_affiliation_strings":["School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA","[School of Electrical Engineering & Computer Science, Oregon State University, Corvallis, USA]"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering and Computer Science, Oregon State University, Corvallis, OR, USA","institution_ids":["https://openalex.org/I131249849"]},{"raw_affiliation_string":"[School of Electrical Engineering & Computer Science, Oregon State University, Corvallis, USA]","institution_ids":["https://openalex.org/I131249849"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5112471787"],"corresponding_institution_ids":["https://openalex.org/I131249849"],"apc_list":null,"apc_paid":null,"fwci":0.3917,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.68352305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"7","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13197","display_name":"Spreadsheets and End-User Computing","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T13197","display_name":"Spreadsheets and End-User Computing","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/computer-science","display_name":"Computer science","score":0.7889264225959778},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.7371492981910706},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6549772620201111},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.6394714117050171},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.6392490863800049},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5709108114242554},{"id":"https://openalex.org/keywords/test","display_name":"Test (biology)","score":0.479884535074234},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.4620702862739563},{"id":"https://openalex.org/keywords/test-case","display_name":"Test case","score":0.45549118518829346},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.42457088828086853},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.35140758752822876},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.25375914573669434},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.20984071493148804},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11008206009864807}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7889264225959778},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.7371492981910706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6549772620201111},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.6394714117050171},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.6392490863800049},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5709108114242554},{"id":"https://openalex.org/C2777267654","wikidata":"https://www.wikidata.org/wiki/Q3519023","display_name":"Test (biology)","level":2,"score":0.479884535074234},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.4620702862739563},{"id":"https://openalex.org/C128942645","wikidata":"https://www.wikidata.org/wiki/Q1568346","display_name":"Test case","level":3,"score":0.45549118518829346},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.42457088828086853},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.35140758752822876},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25375914573669434},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.20984071493148804},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11008206009864807},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"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/C152877465","wikidata":"https://www.wikidata.org/wiki/Q208042","display_name":"Regression analysis","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/vlhcc.2012.6344471","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vlhcc.2012.6344471","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.407.5040","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.407.5040","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.engr.oregonstate.edu//~cscaffid//papers/eu_20121001_ssdiff.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W140883288","https://openalex.org/W1522006088","https://openalex.org/W1966514306","https://openalex.org/W1991983464","https://openalex.org/W2004243213","https://openalex.org/W2010329982","https://openalex.org/W2091027230","https://openalex.org/W2098969990","https://openalex.org/W2108762365","https://openalex.org/W2109227373","https://openalex.org/W2112338634","https://openalex.org/W2121840944","https://openalex.org/W2126634149","https://openalex.org/W2135473121","https://openalex.org/W2152589027","https://openalex.org/W2156924161","https://openalex.org/W2912613330","https://openalex.org/W4230945824","https://openalex.org/W4235587944","https://openalex.org/W4250267379","https://openalex.org/W6605857454"],"related_works":["https://openalex.org/W25732909","https://openalex.org/W4323338832","https://openalex.org/W4289596129","https://openalex.org/W170643605","https://openalex.org/W1999879627","https://openalex.org/W4295189757","https://openalex.org/W2088055539","https://openalex.org/W1574834681","https://openalex.org/W2389167168","https://openalex.org/W2170721049"],"abstract_inverted_index":{"Users":[0],"often":[1],"need":[2],"to":[3,27,92,128,144],"test,":[4],"debug":[5],"or":[6,44],"reuse":[7,55],"spreadsheets.":[8,131],"We":[9],"present":[10,83],"a":[11,22,34,57,63,84],"new":[12,40,85,113,142],"algorithm":[13,71,95,104,115,143],"that":[14,136],"can":[15],"identify":[16],"differences":[17],"between":[18],"two":[19,31,45],"spreadsheets,":[20],"providing":[21],"basis":[23,169],"for":[24,54,72,88,140,170],"future":[25,171],"tools":[26],"help":[28],"users":[29],"compare":[30],"versions":[32],"of":[33,66,155],"spreadsheet":[35,172],"(thereby":[36,48],"seeing":[37,49],"what":[38],"is":[39,51,62,138],"and":[41,96],"needs":[42],"testing)":[43],"different":[46],"spreadsheets":[47,149],"which":[50],"more":[52],"appropriate":[53],"in":[56,106],"situation).":[58],"This":[59],"algorithm,":[60],"RowColAlign,":[61],"two-dimensional":[64],"generalization":[65],"the":[67,74,101,168],"classic":[68],"dynamic":[69],"programming":[70],"solving":[73],"one-dimensional":[75],"longest":[76],"common":[77],"subsequence":[78],"problem.":[79],"In":[80,109],"addition,":[81],"we":[82],"planted":[86],"model":[87],"generating":[89],"test":[90,122,125],"cases":[91,126],"evaluate":[93],"this":[94],"others":[97],"like":[98],"it,":[99],"including":[100,124],"greedy":[102],"SheetDiff":[103],"presented":[105],"prior":[107],"work.":[108],"our":[110,112,141,164],"evaluation,":[111],"RowColAlign":[114],"made":[116],"no":[117],"errors":[118,146],"at":[119],"all":[120],"on":[121],"cases,":[123],"comparable":[127],"relatively":[129],"large":[130],"Moreover,":[132],"further":[133],"analysis":[134],"revealed":[135],"it":[137],"unexpected":[139],"make":[145],"except":[147],"when":[148],"contain":[150],"an":[151],"unrealistically":[152],"small":[153],"number":[154],"distinct":[156],"values.":[157],"These":[158],"results":[159],"are":[160],"extremely":[161],"encouraging,":[162],"revealing":[163],"algorithm's":[165],"potential":[166],"as":[167],"tools.":[173]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}