{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T15:42:21Z","timestamp":1649086941910},"reference-count":5,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"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 Sciences"],"published-print":{"date-parts":[[1999,10]]},"DOI":"10.1016\/s0020-0255(99)00046-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"125-130","source":"Crossref","is-referenced-by-count":4,"title":["The lowest common ancestor problem on a tree with an unfixed root"],"prefix":"10.1016","volume":"119","author":[{"given":"Biing-Feng","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jiunn-Nan","family":"Tsai","sequence":"additional","affiliation":[]},{"given":"Yuan-Cheng","family":"Chuang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0020-0255(99)00046-8_BIB1","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","article-title":"Fast algorithm for finding nearest common ancestors","volume":"13","author":"Harel","year":"1984","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S0020-0255(99)00046-8_BIB2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0020-0190(94)00050-6","article-title":"Finding lowest common ancestors in arbitrarily directed trees","volume":"50","author":"Nykanen","year":"1994","journal-title":"Information Processing Letters"},{"issue":"6","key":"10.1016\/S0020-0255(99)00046-8_BIB3","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","article-title":"On finding lowest common ancestors: Simplification and parallelization","volume":"17","author":"Schieber","year":"1988","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"10.1016\/S0020-0255(99)00046-8_BIB4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF00268844","article-title":"The nearest common ancestor in a dynamic tree","volume":"25","author":"Tsakalidis","year":"1988","journal-title":"Acta Informatica"},{"key":"10.1016\/S0020-0255(99)00046-8_BIB5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(94)00058-1","article-title":"New algorithms for the LCA problem and the binary tree reconstruction problem","volume":"51","author":"Wen","year":"1994","journal-title":"Information Processing Letters"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599000468?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025599000468?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:22:12Z","timestamp":1556043732000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025599000468"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":5,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,10]]}},"alternative-id":["S0020025599000468"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0255(99)00046-8","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}