1 line
13 KiB
Text
1 line
13 KiB
Text
|
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,25]],"date-time":"2023-03-25T02:10:54Z","timestamp":1679710254232},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["STA 850\/49-1"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1016\/j.dam.2023.01.015","type":"journal-article","created":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T23:02:13Z","timestamp":1675292533000},"page":"104-125","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quasi-best match graphs"],"prefix":"10.1016","volume":"331","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-7334-669X","authenticated-orcid":false,"given":"Annachiara","family":"Korchmaros","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-0025-3097","authenticated-orcid":false,"given":"David","family":"Schaller","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-1620-5508","authenticated-orcid":false,"given":"Marc","family":"Hellmuth","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5016-5191","authenticated-orcid":false,"given":"Peter F.","family":"Stadler","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2023.01.015_b1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.4169\/002557010X494814","article-title":"The graph menagerie: Abstract algebra and the mad veterinarian","volume":"83","author":"Abrams","year":"2010","journal-title":"Math. Mag."},{"key":"10.1016\/j.dam.2023.01.015_b2","first-page":"331","article-title":"On certain partitions of finite directed graphs and of finite automata","volume":"6","author":"\u00c1d\u00e1m","year":"1984","journal-title":"Acta Cybernet."},{"key":"10.1016\/j.dam.2023.01.015_b3","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0210030","article-title":"Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions","volume":"10","author":"Aho","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"e1002514","key":"10.1016\/j.dam.2023.01.015_b4","article-title":"Resolving the ortholog conjecture: orthologs tend to be weakly, but significantly, more similar in function than paralogs","volume":"8","author":"Altenhoff","year":"2012","journal-title":"PLoS Comput. Biol."},{"key":"10.1016\/j.dam.2023.01.015_b5","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1006\/aama.1995.1020","article-title":"Extension operations on sets of leaf-labeled trees","volume":"16","author":"Bry
|