{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:03:16Z","timestamp":1725512596827},"reference-count":14,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icde.2004.1320008","type":"proceedings-article","created":{"date-parts":[[2004,9,28]],"date-time":"2004-09-28T13:50:22Z","timestamp":1096379422000},"page":"325-336","source":"Crossref","is-referenced-by-count":0,"title":["SPINE: putting backbone into string indexing"],"prefix":"10.1109","author":[{"family":"Naresh Neelapala","sequence":"first","affiliation":[]},{"family":"Romil Mittal","sequence":"additional","affiliation":[]},{"given":"J.R.","family":"Haritsa","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-48194-X_16","article-title":"On-Line Construction of Compact Directed Acyclic Word Graphs","author":"inenaga","year":"2001","journal-title":"Proc Ann Symp Combinatorial Pattern Matching"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"ref12","article-title":"A Horizontally-Compacted Trie Index for Strings","author":"neelapala","year":"2003","journal-title":"Tech Rep TR-2003&#x2013;05 DSL\/SERC Indian Institute of Science"},{"year":"0","key":"ref13"},{"journal-title":"http \/\/www tigr org\/software\/mummer","year":"0","key":"ref14"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/27.11.2369"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-63220-4_55","article-title":"Direct Construction of Compact Acyclic Word Graphs","author":"crochmore","year":"1997","journal-title":"Proc Ann Symp Combinatorial Pattern Matching"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-48318-7_5","article-title":"Efficient Implementation of Lazy Suffix Trees","author":"giegerich","year":"1999","journal-title":"Proc Workshop Algorithmic Eng"},{"key":"ref8","article-title":"An Efficient Index Structure for String Databases","author":"kahveci","year":"2001","journal-title":"Proc Of the 27th VLDB Conference"},{"key":"ref7","article-title":"A Database Index to Large Biological Sequences","author":"hunt","year":"2001","journal-title":"Proc Of the 27th VLDB Conference"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90157-4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1990.9999"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199911)29:13<1149::AID-SPE274>3.0.CO;2-O"}],"event":{"name":"Proceedings. 20th International Conference on Data Engineering","acronym":"ICDE-04","location":"Boston, MA, USA"},"container-title":["Proceedings. 20th International Conference on Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9217\/29235\/01320008.pdf?arnumber=1320008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T09:49:31Z","timestamp":1533721771000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1320008\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icde.2004.1320008","relation":{},"subject":[]}}