{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:06:48Z","timestamp":1763467608284,"version":"3.28.0"},"reference-count":40,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ssdm.2003.1214978","type":"proceedings-article","created":{"date-parts":[[2004,1,24]],"date-time":"2004-01-24T04:33:03Z","timestamp":1074918783000},"page":"171-180","source":"Crossref","is-referenced-by-count":17,"title":["TreeRank: a similarity measure for nearest neighbor searching in phylogenetic databases"],"prefix":"10.1109","author":[{"given":"J.T.L.","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Huiyuan Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Shasha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.H.","family":"Piel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1016\/0020-0190(92)90136-J"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1145\/372202.372271"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1145\/543613.543620"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/SSDM.2002.1029699"},{"key":"ref31","first-page":"183","article-title":"TreeBASE: A prototype database of phylogenetic analyses and an interactive tool for browsing the phylogeny of life","volume":"81","author":"sanderson","year":"1994","journal-title":"American Journal of Botany"},{"key":"ref30","article-title":"TreeBASE: A database of phylogenetic information","author":"piel","year":"2000","journal-title":"proceedings of the 2nd International Workshop of Species 2000"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1109\/69.298173"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1016\/S0031-3203(01)00055-3"},{"year":"0","journal-title":"TreeGen Tree generation from distance data Computational Biochemistry Research Group ETH Zurich","key":"ref35"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1109\/SSDM.2002.1029709"},{"key":"ref10","first-page":"427","article-title":"On distances between phylogenetic trees","author":"dasgupta","year":"1997","journal-title":"Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1142\/S0129054196000051"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1007\/978-1-4613-0303-9_11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/BF01908061"},{"key":"ref13","first-page":"414","article-title":"Computing with trees","author":"diaconis","year":"1999","journal-title":"Proceedings of the 31st Symposium on the Interface"},{"year":"1985","author":"douchette","article-title":"An efficient algorithm to compute quartet dissimilarity measures","key":"ref14"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1016\/0196-8858(87)90003-0"},{"key":"ref16","article-title":"Fast comparison of evolutionary trees","author":"farach","year":"1994","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/SFCS.1994.365716"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1016\/S0166-218X(96)00062-5"},{"year":"0","author":"joyce","journal-title":"Phylogeny and reconstructing phylogenetic trees","key":"ref19"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1111\/j.1096-0031.1989.tb00563.x"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1007\/BF01890118"},{"year":"2000","journal-title":"NSF Workshop Report at Yale University","key":"ref27"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1007\/3-540-45678-3_62","article-title":"Computing the quartet distance between evolutionary trees in time O(nlog2n)","volume":"2223","author":"brodal","year":"2001","journal-title":"Proceedings of Annual International Symposium on Algorithms and Computation"},{"key":"ref6","first-page":"387","article-title":"The recovery of trees from measures of dissimilarity","author":"buneman","year":"1971","journal-title":"Math and the Archeological and Historical Sciences"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1016\/S0169-5347(98)01438-4"},{"key":"ref5","article-title":"Computing the quartet distance between evolutionary trees","author":"bryant","year":"2000","journal-title":"Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1137\/S0097539796313477"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.2307\/2406441"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/299432.299457"},{"key":"ref9","first-page":"323","article-title":"An O(n log n) algorithm for the maximum agreement subtree problem for binary trees","author":"cole","year":"1996","journal-title":"Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1093\/sysbio\/21.4.390"},{"key":"ref20","first-page":"475","article-title":"Determining the evolutionary tree","author":"kannan","year":"1990","journal-title":"Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1145\/258533.258550"},{"key":"ref21","article-title":"Computing the local consensus of trees","author":"kannan","year":"1995","journal-title":"Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref24","first-page":"124","article-title":"Computing the unrooted maximum agreement subtree in subquadratic time","author":"lam","year":"1996","journal-title":"Proc Scandinavian Workshop Algorithms Theory"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1007\/BF01202269"},{"key":"ref26","first-page":"237","article-title":"An analysis of the general tree-editing problem","author":"noetzel","year":"1983","journal-title":"Time Warps String Edits and Macromolecules The Theory and Practice of Sequence Comparison"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.2307\/2412995"}],"event":{"acronym":"SSDM-03","name":"15th International Conference on Scientific and Statistical Database Management","location":"Cambridge, MA, USA"},"container-title":["15th International Conference on Scientific and Statistical Database Management, 2003."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8623\/27320\/01214978.pdf?arnumber=1214978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,9]],"date-time":"2018-04-09T04:55:16Z","timestamp":1523249716000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1214978\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/ssdm.2003.1214978","relation":{},"subject":[]}}