乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:07:49Z","timestamp":1740114469026,"version":"3.37.3"},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T00:00:00Z","timestamp":1608422400000},"content-version":"vor","delay-in-days":1480,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2014R1A1A1004901","2014R1A2A1A11050337","NRF-2014M3C9A3064706"],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Signal Intelligence Research Center"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1016\/j.tcs.2016.04.028","type":"journal-article","created":{"date-parts":[[2016,5,9]],"date-time":"2016-05-09T22:52:19Z","timestamp":1462834339000},"page":"173-179","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"PB","title":["A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm"],"prefix":"10.1016","volume":"656","author":[{"given":"Youngho","family":"Kim","sequence":"first","affiliation":[]},{"given":"Joong Chae","family":"Na","sequence":"additional","affiliation":[]},{"given":"Heejin","family":"Park","sequence":"additional","affiliation":[]},{"given":"Jeong Seop","family":"Sim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"6","key":"10.1016\/j.tcs.2016.04.028_br0010","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/360825.360855","article-title":"Efficient string matching: an aid to bibliographic search","volume":"18","author":"Aho","year":"1975","journal-title":"Commun. ACM"},{"key":"10.1016\/j.tcs.2016.04.028_br0020","series-title":"Proc. of the 10th Int. Conf. on World Wide Web","first-page":"162","article-title":"Clustering user queries of a search engine","author":"Wen","year":"2001"},{"key":"10.1016\/j.tcs.2016.04.028_br0030","series-title":"Proc. of the Jt. EDBT\/ICDT 2013 Workshops","first-page":"397","article-title":"FPI: a novel indexing method using frequent patterns for approximate string searches","author":"Kimura","year":"2013"},{"key":"10.1016\/j.tcs.2016.04.028_br0040","series-title":"IEEE Int. Congr. on Big Data","first-page":"31","article-title":"Approximate two-party privacy-preserving string matching with linear complexity","author":"Beck","year":"2013"},{"key":"10.1016\/j.tcs.2016.04.028_br0050","series-title":"Proc. IEEE Symp. Res. Security Privacy","first-page":"202","article-title":"Self-nonself discrimination in a computer","author":"Forrest","year":"1994"},{"key":"10.1016\/j.tcs.2016.04.028_br0060","series-title":"Proc. of the 13th Conf. on Syst. Adm.","first-page":"229","article-title":"Snort \u2013 lightweight intrusion detection for networks","author":"Roesch","year":"1999"},{"issue":"3","key":"10.1016\/j.tcs.2016.04.028_br0070","first-page":"202","article-title":"Parallel construction for the graph model of the longest common non-superstring using CUDA","volume":"39","author":"Yoon","year":"2012","journal-title":"J. KIISE: Comput. Syst. Theory"},{"issue":"3","key":"10.1016\/j.tcs.2016.04.028_br0080","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","article-title":"A general method applicable to the search for similarities in the amino acid sequence of two proteins","volume":"48","author":"Needleman","year":"1970","journal-title":"J. Mol. Biol."},{"issue":"1","key":"10.1016\/j.tcs.2016.04.028_br0090","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0022-2836(81)90087-5","article-title":"Identification of common molecular subsequences","volume":"147","author":"Smith","year":"1981","journal-title":"J. Mol. Biol."},{"issue":"14","key":"10.1016\/j.tcs.2016.04.028_br0100","doi-asserted-by":"crossref","first-page":"1754","DOI":"10.1093\/bioinformatics\/btp324","article-title":"Fast and accurate short read alignment with Burrows\u2013Wheeler transform","volume":"25","author":"Li","year":"2009","journal-title":"Bioinformatics"},{"issue":"5","key":"10.1016\/j.tcs.2016.04.028_br0110","doi-asserted-by":"crossref","DOI":"10.1371\/journal.pone.0065632","article-title":"SOAP3-dp: fast, accurate and sensitive GPU-based short read aligner","volume":"8","author":"Luo","year":"2013","journal-title":"PLoS ONE"},{"year":"1997","series-title":"Algorithm on Strings, Trees, and Sequences","author":"Gusfield","key":"10.1016\/j.tcs.2016.04.028_br0120"},{"issue":"1","key":"10.1016\/j.tcs.2016.04.028_br0130","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(85)90023-9","article-title":"Finding approximate patterns in strings","volume":"6","author":"Ukkonen","year":"1985","journal-title":"J. Algorithms"},{"issue":"1","key":"10.1016\/j.tcs.2016.04.028_br0140","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","article-title":"A faster algorithm computing string edit distance","volume":"20","author":"Masek","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.tcs.2016.04.028_br0150","series-title":"ICCS 2008, Part I","first-page":"893","article-title":"Extending the Four Russian algorithm to compute the edit script in linear space","volume":"vol. 5101","author":"Kundeti","year":"2008"},{"year":"2009","series-title":"Introduction to Algorithms","author":"Cormen","key":"10.1016\/j.tcs.2016.04.028_br0160"},{"issue":"1\u20133","key":"10.1016\/j.tcs.2016.04.028_br0170","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","article-title":"Algorithms for approximate string matching","volume":"64","author":"Ukkonen","year":"1985","journal-title":"Inf. Control"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516300676?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516300676?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T03:04:35Z","timestamp":1608433475000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397516300676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":17,"alternative-id":["S0304397516300676"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2016.04.028","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2016,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2016.04.028","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}