{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T22:39:14Z","timestamp":1776983954572,"version":"3.51.4"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1016\/s0020-0190(01)00263-0","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"159-164","source":"Crossref","is-referenced-by-count":117,"title":["Partition-distance: A problem and class of perfect graphs arising in clustering"],"prefix":"10.1016","volume":"82","author":[{"given":"Dan","family":"Gusfield","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00263-0_BIB001","doi-asserted-by":"crossref","first-page":"136","DOI":"10.2307\/1400594","article-title":"Estimation of single generation sibling relationships based on DNA markers","volume":"4","author":"Almudevar","year":"1999","journal-title":"J. Agricultural, Biological Environment. Statist."},{"key":"10.1016\/S0020-0190(01)00263-0_BIB002","series-title":"Graph Classes \u2014 A Survey","volume":"3","author":"Brandstadt","year":"1999"},{"key":"10.1016\/S0020-0190(01)00263-0_BIB003","series-title":"Combinatorial Optimization","author":"Cook","year":"1998"},{"key":"10.1016\/S0020-0190(01)00263-0_BIB004","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(01)00263-0_BIB005","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0020-0190(01)00263-0_BIB006","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The ellipsoid method and its consequences in combinatorial optimization","volume":"1","author":"Grotschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/S0020-0190(01)00263-0_BIB007","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002630?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002630?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T05:28:18Z","timestamp":1556774898000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002630"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0020019001002630"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00263-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}