{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:27:46Z","timestamp":1742920066679,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":4,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387355443"},{"type":"electronic","value":"9780387399409"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-0-387-39940-9_1307","type":"book-chapter","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T08:43:04Z","timestamp":1253090584000},"page":"223-224","source":"Crossref","is-referenced-by-count":0,"title":["Biological Sequences"],"prefix":"10.1007","author":[{"given":"Amarnath","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1307_CR1_1307","unstructured":"Brown A.L. Constructing genome scale suffix trees. In Proc. 2nd Asia-Pacific Bioinformatics Conference, 2004."},{"key":"1307_CR2_1307","unstructured":"Hunt E., Atkinson M.P., and Irving R.W. A database index to large biological sequences. In Proc. 27th Int. Conf. on Very Large Data Bases, 2001, pp. 139\u2013148."},{"key":"1307_CR3_1307","doi-asserted-by":"crossref","unstructured":"Phoophakdee B. and Zaki M.J. TRELLIS\u00a0+: an effective approach for indexing genome-scale sequences using suffix trees. In Proceedings of the Pacific Symposium on Biocomputing (online proceedings), 2008, pp. 90\u2013101.","DOI":"10.1142\/9789812776136_0011"},{"key":"1307_CR4_1307","doi-asserted-by":"crossref","unstructured":"Tian Y., Tata S., Hankins R.A., and Patel J.M. Practical methods for constructing suffix trees. VLDB J., 14(3):281\u2013299, 2005.","DOI":"10.1007\/s00778-005-0154-8"}],"container-title":["Encyclopedia of Database Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-39940-9_1307","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T05:31:24Z","timestamp":1739338284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-0-387-39940-9_1307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9780387355443","9780387399409"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-39940-9_1307","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}