乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:44:38Z","timestamp":1725533078497},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024801"},{"type":"electronic","value":"9783642024818"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","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-3-642-02481-8_178","type":"book-chapter","created":{"date-parts":[[2009,6,5]],"date-time":"2009-06-05T21:18:06Z","timestamp":1244236686000},"page":"1178-1186","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Exact Pattern-Matching in Proteomic Sequences"],"prefix":"10.1007","author":[{"given":"S\u00e9rgio","family":"Deusdado","sequence":"first","affiliation":[]},{"given":"Paulo","family":"Carvalho","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"178_CR1","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput.\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"issue":"10","key":"178_CR2","first-page":"762","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. Assoc. Comput. Mach.\u00a020(10), 762\u2013772 (1977)","journal-title":"Commun. Assoc. Comput. Mach."},{"issue":"6","key":"178_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1002\/spe.4380100608","volume":"10","author":"R.N. Horspool","year":"1980","unstructured":"Horspool, R.N.: Practical fast searching in strings. Software - Practice & Experience\u00a010(6), 501\u2013506 (1980)","journal-title":"Software - Practice & Experience"},{"issue":"8","key":"178_CR4","first-page":"132","volume":"33","author":"D.M. Sunday","year":"1990","unstructured":"Sunday, D.M.: A very fast substring search algorithm. Commun. Assoc. Comput. Mach.\u00a033(8), 132\u2013142 (1990)","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"178_CR5","doi-asserted-by":"crossref","unstructured":"Kim, S.: A new string-pattern matching algorithm using partitioning and hashing efficiently. Journal of Experimental Algorithmics (JEA)\u00a04(2) (1999)","DOI":"10.1145\/347792.347803"},{"issue":"4\/5","key":"178_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01185427","volume":"12","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Czumaj, A., Gasieniec, L., Jarominek, S., Lecroq, T., Plandowski, W., Rytter, W.: Speeding up Two String Matching Algorithms. Algorithmica\u00a012(4\/5), 247\u2013267 (1994)","journal-title":"Algorithmica"},{"issue":"10","key":"178_CR7","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R.A. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Commun. ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Commun. ACM"},{"issue":"2","key":"178_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"R.M. Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev.\u00a031(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"key":"178_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/11496656_25","volume-title":"Combinatorial Pattern Matching","author":"F. Franek","year":"2005","unstructured":"Franek, F., Jennings, C.G., Smyth, W.F.: A Simple Fast Hybrid Pattern-Matching Algorithm. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 288\u2013297. Springer, Heidelberg (2005)"},{"issue":"4","key":"178_CR10","first-page":"1","volume":"5","author":"G. Navarro","year":"2000","unstructured":"Navarro, G., Raffinot, M.: Fast and Flexible String Matching by Combining Bitparallelism and Suffix automata. ACM Journal of Experimental Algorithms\u00a05(4), 1\u201336 (2000)","journal-title":"ACM Journal of Experimental Algorithms"},{"key":"178_CR11","volume-title":"Text algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text algorithms. Oxford University Press, Oxford (1994)"},{"key":"178_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-39984-1_7","volume-title":"String Processing and Information Retrieval","author":"H. Peltola","year":"2003","unstructured":"Peltola, H., Tarhio, J.: Alternative Algorithms for Bit-Parallel String Matching. In: Nascimento, M.A., de Moura, E.S., Oliveira, A.L. (eds.) SPIRE 2003. LNCS, vol.\u00a02857, pp. 80\u201393. Springer, Heidelberg (2003)"},{"key":"178_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.ipl.2007.01.002","volume":"102","author":"T. Lecroq","year":"2007","unstructured":"Lecroq, T.: Fast exact string matching algorithms. Information Processing Letters\u00a0102, 229\u2013235 (2007)","journal-title":"Information Processing Letters"},{"key":"178_CR14","unstructured":"Wu, S., Manber, U.: A fast algorithm for multi-pattern searching. TR-94-17, Department of Computer Science, University of Arizona, Tucson (1994)"},{"issue":"4","key":"178_CR15","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1080\/00207160108805036","volume":"76","author":"P.D. Michailidis","year":"2001","unstructured":"Michailidis, P.D., Maragaritis, K.G.: On-line String Matching Algorithms: Survey and Experimental Results. International Journal of Computer Mathematics\u00a076(4), 411\u2013434 (2001)","journal-title":"International Journal of Computer Mathematics"},{"issue":"7","key":"178_CR16","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1002\/spe.4380250703","volume":"25","author":"T. Lecroq","year":"1995","unstructured":"Lecroq, T.: Experimental Results on String Matching Algorithms. Software - Pratice and Experience\u00a025(7), 727\u2013765 (1995)","journal-title":"Software - Pratice and Experience"},{"key":"178_CR17","volume-title":"Computing Patterns in Strings","author":"B. Smyth","year":"2003","unstructured":"Smyth, B.: Computing Patterns in Strings. Pearson Addison-Wesley, London (2003)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02481-8_178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T13:20:08Z","timestamp":1552051208000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02481-8_178"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024801","9783642024818"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02481-8_178","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}