{"id":"https://openalex.org/W2081964001","doi":"https://doi.org/10.1109/iccabs.2013.6629217","title":"Triangulation heuristics for maximum character compatibility","display_name":"Triangulation heuristics for maximum character compatibility","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2081964001","doi":"https://doi.org/10.1109/iccabs.2013.6629217","mag":"2081964001"},"language":"en","primary_location":{"id":"doi:10.1109/iccabs.2013.6629217","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccabs.2013.6629217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 3rd International Conference on Computational Advances in Bio and medical Sciences (ICCABS)","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/A5023497224","display_name":"Rob Gysel","orcid":null},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rob Gysel","raw_affiliation_strings":["Department of Computer Science, University of California, Davis, Davis, CA, USA","Department of Computer Science, University of California\u2014Davis, Davis, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Davis, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]},{"raw_affiliation_string":"Department of Computer Science, University of California\u2014Davis, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062896251","display_name":"Dan Gusfield","orcid":"https://orcid.org/0000-0002-7469-5103"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dan Gusfield","raw_affiliation_strings":["Department of Computer Science, University of California, Davis, Davis, CA, USA","Department of Computer Science, University of California\u2014Davis, Davis, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of California, Davis, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]},{"raw_affiliation_string":"Department of Computer Science, University of California\u2014Davis, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011867405","display_name":"Kristian Stevens","orcid":null},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kristian Stevens","raw_affiliation_strings":["Department of Computer Science and Department of Evolution and Ecology, University of California, Davis, Davis, CA, USA","Department of Computer Science, University of California\u2014Davis, Davis, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Department of Evolution and Ecology, University of California, Davis, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]},{"raw_affiliation_string":"Department of Computer Science, University of California\u2014Davis, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5023497224"],"corresponding_institution_ids":["https://openalex.org/I84218800"],"apc_list":null,"apc_paid":null,"fwci":1.8127,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.85700126,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"4","issue":null,"first_page":"1","last_page":"2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9939000010490417,"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/T11106","display_name":"Data Management and Algorithms","score":0.9811000227928162,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.90897536277771},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6510791182518005},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.6020858287811279},{"id":"https://openalex.org/keywords/monochromatic-color","display_name":"Monochromatic color","score":0.5857228636741638},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5733336210250854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.50962233543396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38006776571273804},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34576576948165894},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3425500690937042},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32646769285202026}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.90897536277771},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6510791182518005},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.6020858287811279},{"id":"https://openalex.org/C40833965","wikidata":"https://www.wikidata.org/wiki/Q6901438","display_name":"Monochromatic color","level":2,"score":0.5857228636741638},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5733336210250854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.50962233543396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38006776571273804},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34576576948165894},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3425500690937042},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32646769285202026},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C59822182","wikidata":"https://www.wikidata.org/wiki/Q441","display_name":"Botany","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccabs.2013.6629217","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccabs.2013.6629217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 3rd International Conference on Computational Advances in Bio and medical Sciences (ICCABS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W2828953","https://openalex.org/W1572683371","https://openalex.org/W1596422325","https://openalex.org/W1856740933","https://openalex.org/W1969277007","https://openalex.org/W1982453483","https://openalex.org/W2037106315","https://openalex.org/W2063694895","https://openalex.org/W2072082202","https://openalex.org/W2116404859","https://openalex.org/W2134599124","https://openalex.org/W2137240419","https://openalex.org/W2155956035","https://openalex.org/W4250164480"],"related_works":["https://openalex.org/W2509614667","https://openalex.org/W2963293152","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W1536056491","https://openalex.org/W2041180560"],"abstract_inverted_index":{"In":[0],"this":[1,26,104],"paper,":[2],"we":[3],"describe,":[4],"to":[5,15,31,90],"our":[6,48,61,68,73],"knowledge,":[7],"the":[8,16,44,54],"first":[9,37],"fast,":[10],"accurate,":[11],"triangulation-based":[12],"heuristic":[13,38,50,63,74],"solutions":[14,75,78],"two-state":[17],"maximum":[18],"character":[19],"compatibility":[20],"problem":[21,27],"with":[22,76,103],"missing":[23],"data.":[24],"Recently,":[25],"has":[28],"been":[29],"reduced":[30],"a":[32,40],"graph":[33],"triangulation":[34,45,82],"problem.":[35],"Our":[36],"follows":[39],"classic":[41,69],"approach":[42],"from":[43,80],"literature,":[46],"and":[47,87],"second":[49],"is":[51],"informed":[52,62],"by":[53],"separation":[55],"of":[56,95],"monochromatic":[57],"pairs.":[58],"While":[59],"slower,":[60],"generally":[64],"performed":[65],"better":[66],"than":[67,100],"heuristic.":[70],"We":[71],"compared":[72],"optimal":[77],"obtained":[79],"minimal":[81],"integer":[83,105],"programs":[84],"when":[85],"possible,":[86],"were":[88,101],"able":[89],"solve":[91],"problems":[92],"an":[93],"order":[94],"magnitude":[96],"larger":[97],"using":[98],"heuristics":[99],"possible":[102],"program.":[106]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}