{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T01:55:38Z","timestamp":1775440538254,"version":"3.50.1"},"publisher-location":"Providence, Rhode Island","reference-count":0,"publisher":"American Mathematical Society","isbn-type":[{"value":"9780821831977","type":"print"},{"value":"9780821871034","type":"print"},{"value":"9781470440190","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003,4,15]]},"DOI":"10.1090\/dimacs\/061\/04","type":"book-chapter","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T22:34:03Z","timestamp":1493246043000},"page":"55-65","source":"Crossref","is-referenced-by-count":13,"title":["The size of a maximum agreement subtree for random binary trees"],"prefix":"10.1090","author":[{"given":"David","family":"Bryant","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andy","family":"McKenzie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Steel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","container-title":["DIMACS Series in Discrete Mathematics and Theoretical Computer Science","Bioconsensus"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T00:56:30Z","timestamp":1775436990000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/dimacs\/061"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4,15]]},"ISBN":["9780821831977","9780821871034","9781470440190"],"references-count":0,"URL":"https:\/\/doi.org\/10.1090\/dimacs\/061\/04","relation":{},"ISSN":["1052-1798","2472-4793"],"issn-type":[{"value":"1052-1798","type":"print"},{"value":"2472-4793","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,4,15]]}}}