乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T02:13:40Z","timestamp":1712715220418},"reference-count":31,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1006\/jagm.2001.1191","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T23:19:36Z","timestamp":1032304776000},"page":"338-359","source":"Crossref","is-referenced-by-count":33,"title":["On the Common Substring Alignment Problem"],"prefix":"10.1006","volume":"41","author":[{"given":"Gad M","family":"Landau","sequence":"first","affiliation":[]},{"given":"Michal","family":"Ziv-Ukelson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jagm.2001.1191_RF1","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01840359","article-title":"Geometric applications of a matrix-searching algorithm","volume":"2","author":"Aggarwal","year":"1987","journal-title":"Algorithmica"},{"key":"10.1006\/jagm.2001.1191_RF2","series-title":"Proceedings of the 29th IEEE Symposium on Foundations of Computer Science","article-title":"Notes on searching in multidimensional monotone Arrays","author":"Aggarawal","year":"1988"},{"key":"10.1006\/jagm.2001.1191_RF3","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1137\/0219066","article-title":"Efficient parallel algorithms for string editing problems","volume":"19","author":"Apostolico","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1006\/jagm.2001.1191_RF4","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/0304-3975(95)92848-R","article-title":"A space efficient algorithm for finding the best nonoverlapping alignment score","volume":"145","author":"Benson","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1006\/jagm.2001.1191_RF5","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1145\/306101.306124","article-title":"Discovering internet marketing intelligence through online analytical web usage mining","volume":"27","author":"Buechner","year":"1998","journal-title":"SIGMOD Record"},{"key":"10.1006\/jagm.2001.1191_RF6","series-title":"The 16th International Conference on Distributed Computing Systems","article-title":"Data mining for path traversal patterns in a web environment","author":"Chen","year":"1996"},{"key":"10.1006\/jagm.2001.1191_RF7","series-title":"Proceedings of the 29th IEEE Symposium on Foundations of Computer Science","article-title":"Speeding up dynamic programming","author":"Eppstein","year":"1988"},{"key":"10.1006\/jagm.2001.1191_RF8","series-title":"Proceedings of the 2000 International Conference on Intelligent User Interfaces","article-title":"A task-based architecture for application-aware adjuncts","author":"Farrell","year":"2000"},{"key":"10.1006\/jagm.2001.1191_RF9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1006\/jagm.2001.1191_RF10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(89)90101-1","article-title":"Speeding up dynamic programming with applications to molecular biology","volume":"64","author":"Galil","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1006\/jagm.2001.1191_RF11","doi-asserted-by":"crossref","first-page":"9061","DOI":"10.1073\/pnas.93.17.9061","article-title":"Gene recognition via spliced sequence alignment","volume":"93","author":"Gelfand","year":"1996","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"10.1006\/jagm.2001.1191_RF12","series-title":"Pattern Matching Algorithms","first-page":"201","article-title":"Dynamic Programming: Special cases","author":"Giancarlo","year":"1997"},{"key":"10.1006\/jagm.2001.1191_RF13","series-title":"Algorithms on Strings, Trees, and Sequences","author":"Gusfield","year":"1997"},{"key":"10.1006\/jagm.2001.1191_RF14","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","article-title":"A linear space algorithm for computing maximal common subsequences","volume":"18","author":"Hirschberg","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1006\/jagm.2001.1191_RF15","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1137\/0216043","article-title":"The least weight subsequence problem","volume":"16","author":"Hirshberg","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1006\/jagm.2001.1191_RF16","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1137\/S0097539794262677","article-title":"An algorithm for locating non-overlapping regions of maximum alignment score","volume":"25","author":"Kannan","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1006\/jagm.2001.1191_RF17","series-title":"Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching","article-title":"Approximate string matching over Ziv\u2013Lempel compressed text","author":"Karkkainen","year":"2000"},{"key":"10.1006\/jagm.2001.1191_RF18","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1137\/S0097539794264810","article-title":"Incremental string comparison","volume":"27","author":"Landau","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1006\/jagm.2001.1191_RF19","series-title":"Proceedings of the Symposium on Discrete Algorithms","article-title":"On the shared substring alignment problem","author":"Landau","year":"2000"},{"key":"10.1006\/jagm.2001.1191_RF20","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/A:1009843912662","article-title":"Visualization and analysis of clickstream data of online stores for understanding web merchandising","volume":"5","author":"Lee","year":"2001","journal-title":"J. Data Mining Knowledge Discovery"},{"key":"10.1006\/jagm.2001.1191_RF21","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Soviet Phys. Dokl."},{"key":"10.1006\/jagm.2001.1191_RF22","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF02459948","article-title":"Sequence comparison with concave weighting functions","volume":"50","author":"Miller","year":"1988","journal-title":"Bull. Math. Biol."},{"key":"10.1006\/jagm.2001.1191_RF23","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1006\/geno.1998.5251","article-title":"Performance-guarantee gene predictions via spliced alignment","author":"Mironov","year":"1998","journal-title":"Genomics 51 A.N. GE985251"},{"key":"10.1006\/jagm.2001.1191_RF24","article-title":"Deblai et Remblai","author":"Monge","year":"1781","journal-title":"Mem. Acad. Sci. Paris"},{"key":"10.1006\/jagm.2001.1191_RF25","series-title":"Calculating the Secrets of Life","first-page":"56","article-title":"Seeing conserved signals: Using algorithms to detect similarities between biosequences","author":"Myers","year":"1995"},{"key":"10.1006\/jagm.2001.1191_RF26","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0097-8485(96)00034-4","article-title":"Combinatorial approaches to gene recognition","volume":"21","author":"Roytberg","year":"1997","journal-title":"Comput. Chem."},{"key":"10.1006\/jagm.2001.1191_RF27","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1137\/S0097539795288489","article-title":"All highest scoring paths in weighted grid graphs and their application to finding all approximate repeats in strings","volume":"27","author":"Schmidt","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1006\/jagm.2001.1191_RF28","series-title":"COMPCON Spring 91, the 36th IEEE International Computer Conference","article-title":"A system for distributed intrusion detection","author":"Snapp","year":"1991"},{"key":"10.1006\/jagm.2001.1191_RF29","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1089\/cmb.1997.4.297","article-title":"Las Vegas algorithms for gene recognition: Suboptimal and error-tolerant spliced alignment","volume":"4","author":"Sze","year":"1997","journal-title":"J. Comp. Biol."},{"key":"10.1006\/jagm.2001.1191_RF30","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"},{"key":"10.1006\/jagm.2001.1191_RF31","unstructured":"M. Ziv-Ukelson, Y. Horesh, G. M. Landau, and, R. Unger, Using repeats to speedup DNA sequence alignment, private communication."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677401911915?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677401911915?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T07:22:06Z","timestamp":1557386526000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677401911915"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S0196677401911915"],"URL":"https:\/\/doi.org\/10.1006\/jagm.2001.1191","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}