{"id":"https://openalex.org/W2510745580","doi":"https://doi.org/10.1109/infcomw.2016.7562077","title":"Computing road signatures from cell sequences with minimum inconsistencies","display_name":"Computing road signatures from cell sequences with minimum inconsistencies","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2510745580","doi":"https://doi.org/10.1109/infcomw.2016.7562077","mag":"2510745580"},"language":"en","primary_location":{"id":"doi:10.1109/infcomw.2016.7562077","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcomw.2016.7562077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","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/A5060590657","display_name":"Lisa Zhang","orcid":"https://orcid.org/0000-0002-4255-9609"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Lisa Zhang","raw_affiliation_strings":["Alcatel-Lucent Bell Labs, Murray Hill, NJ"],"affiliations":[{"raw_affiliation_string":"Alcatel-Lucent Bell Labs, Murray Hill, NJ","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077188973","display_name":"Matthew Andrews","orcid":"https://orcid.org/0000-0002-0977-9685"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Matthew Andrews","raw_affiliation_strings":["Alcatel-Lucent Bell Labs, Murray Hill, NJ"],"affiliations":[{"raw_affiliation_string":"Alcatel-Lucent Bell Labs, Murray Hill, NJ","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048855340","display_name":"Jin Cao","orcid":"https://orcid.org/0000-0002-1247-4129"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jin Cao","raw_affiliation_strings":["Alcatel-Lucent Bell Labs, Murray Hill, NJ"],"affiliations":[{"raw_affiliation_string":"Alcatel-Lucent Bell Labs, Murray Hill, NJ","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5060590657"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2522,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52709301,"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":"227","last_page":"232"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11980","display_name":"Human Mobility and Location-Based Analysis","score":0.9941999912261963,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T13282","display_name":"Automated Road and Building Extraction","score":0.9901000261306763,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.6978591084480286},{"id":"https://openalex.org/keywords/signature","display_name":"Signature (topology)","score":0.6894708275794983},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6153590083122253},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5828474760055542},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.5542647838592529},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5420310497283936},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4700782597064972},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45566999912261963},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4549316167831421},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25876879692077637}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6978591084480286},{"id":"https://openalex.org/C2779696439","wikidata":"https://www.wikidata.org/wiki/Q7512811","display_name":"Signature (topology)","level":2,"score":0.6894708275794983},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6153590083122253},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5828474760055542},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.5542647838592529},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5420310497283936},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4700782597064972},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45566999912261963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4549316167831421},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25876879692077637},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infcomw.2016.7562077","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcomw.2016.7562077","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7699999809265137}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1605476884","https://openalex.org/W1964717191","https://openalex.org/W2008814765","https://openalex.org/W2011039300","https://openalex.org/W2039451540","https://openalex.org/W2049626361","https://openalex.org/W2070745908","https://openalex.org/W2112352770","https://openalex.org/W2125344207","https://openalex.org/W6636268392"],"related_works":["https://openalex.org/W3162204513","https://openalex.org/W2371138613","https://openalex.org/W2048963458","https://openalex.org/W43109613","https://openalex.org/W2359952343","https://openalex.org/W2239445980","https://openalex.org/W1671124163","https://openalex.org/W2168674042","https://openalex.org/W2080152487","https://openalex.org/W3083152911"],"abstract_inverted_index":{"Using":[0],"Call":[1],"Detail":[2],"Records":[3],"(CDR)":[4],"to":[5,19,37,50,64,95,136,143,173,182,236,242],"track":[6],"mobile":[7,34],"locations":[8],"is":[9,25,35,69,109,134,156,189],"becoming":[10],"increasingly":[11],"popular.":[12],"In":[13,194],"this":[14,195],"paper,":[15],"we":[16,176,197,232],"design":[17],"algorithms":[18,235],"compute":[20,183],"a":[21,26,33,70,82,87,138,145,178,185,199,237],"road":[22,58],"signature,":[23],"which":[24,209],"typical":[27],"sequence":[28],"of":[29,72,79,112,151,169,239],"cell":[30,73,96,100,161],"sites":[31,162],"that":[32,147,206],"connected":[36],"when":[38,129],"traveling":[39],"on":[40,56],"the":[41,57,60,77,124,149,164,174,215,224],"road.":[42],"A":[43],"good":[44],"signature":[45,66,108,146,165],"provides":[46],"an":[47,110],"easy":[48],"way":[49],"determine":[51],"whether":[52],"other":[53],"mobiles":[54],"travel":[55],"in":[59,81,92,102,115,163,214,223],"future.":[61],"The":[62,106],"input":[63,104,120,125,216],"our":[65,234,244],"creation":[67],"problem":[68],"set":[71,238],"sequences.":[74,121],"We":[75,141],"capture":[76],"ordering":[78,111],"cells":[80,213],"directed":[83,88],"graph":[84],"G,":[85,116],"where":[86],"arc":[89],"(u,":[90],"v)":[91],"G":[93,130],"corresponds":[94],"u":[97],"appearing":[98],"before":[99],"v":[101],"some":[103],"sequence.":[105],"output":[107],"all":[113,119],"nodes":[114],"ideally":[117],"respecting":[118],"However,":[122],"if":[123],"contains":[126,131],"inconsistencies,":[127],"namely":[128],"cycles,":[132],"it":[133],"impossible":[135],"create":[137,144],"consistent":[139],"signature.":[140,186,225],"aim":[142],"minimizes":[148,207],"amount":[150],"inconsistency.":[152,230],"If":[153],"1-position":[154],"inconsistency":[155,188],"feasible,":[157],"meaning":[158],"only":[159],"neighboring":[160,212],"can":[166],"be":[167],"out":[168],"order":[170],"with":[171],"respect":[172],"input,":[175],"provide":[177],"polynomial-time":[179],"combinatorial":[180],"algorithm":[181,202],"such":[184],"Otherwise,":[187],"more":[190,200],"than":[191],"1":[192],"position.":[193],"case":[196],"present":[198],"general":[201],"via":[203],"dynamic":[204],"programming":[205],"stretch,":[208],"means":[210],"any":[211],"are":[217],"placed":[218],"as":[219,221],"close":[220],"possible":[222],"This":[226],"generalization":[227],"includes":[228],"b-position":[229],"Finally,":[231],"apply":[233],"CDR":[240],"traces":[241],"illustrate":[243],"results.":[245]},"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}