乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T18:17:02Z","timestamp":1725819422656},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319167053"},{"type":"electronic","value":"9783319167060"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16706-0_1","type":"book-chapter","created":{"date-parts":[[2015,3,25]],"date-time":"2015-03-25T08:54:01Z","timestamp":1427273641000},"page":"1-12","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Efficient Alignment Free Sequence Comparison with Bounded Mismatches"],"prefix":"10.1007","author":[{"given":"Srinivas","family":"Aluru","sequence":"first","affiliation":[]},{"given":"Alberto","family":"Apostolico","sequence":"additional","affiliation":[]},{"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,26]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1089\/cmb.1998.5.173","volume":"5","author":"A Apostolico","year":"1998","unstructured":"Apostolico, A., Giancarlo, R.: Sequence alignment in molecular biology. Journal of Computational Biology 5(2), 173\u2013196 (1998)","journal-title":"Journal of Computational Biology"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Apostolico, A., Guerra, C., Pizzi, C.: Alignment free sequence similarity with bounded hamming distance. In: DCC, pp. 183\u2013192. IEEE (2014)","DOI":"10.1109\/DCC.2014.57"},{"issue":"5","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1971","DOI":"10.1073\/pnas.96.5.1971","volume":"96","author":"T Asai","year":"1999","unstructured":"Asai, T., Zaporojets, D., Squires, C., Squires, C.L.: An escherichia coli strain with all chromosomal rRNA operons inactivated: complete exchange of rRNA genes between bacteria. National Academy of Sciences 96(5), 1971\u20131976 (1999)","journal-title":"National Academy of Sciences"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bonham-Carter, O., Steele, J., Bastola, D.: Alignment-free genetic sequence comparisons: a review of recent approaches by word analysis. Briefings in Bioinformatics 890\u2013905 (2013)","DOI":"10.1093\/bib\/bbt052"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/11415770_22","volume-title":"Research in Computational Molecular Biology","author":"D Burstein","year":"2005","unstructured":"Burstein, D., Ulitsky, I., Tuller, T., Chor, B.: Information theoretic approaches to whole genome phylogenies. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3500, pp. 283\u2013295. Springer, Heidelberg (2005)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Cole, R., Gottlieb, L.-A., Lewenstein, M.: Dictionary matching and indexing with errors and don\u2019t cares. In: STOC, pp. 91\u2013100 (2004)","DOI":"10.1145\/1007352.1007374"},{"issue":"6","key":"1_CR7","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1145\/355541.355547","volume":"47","author":"M Farach-Colton","year":"2000","unstructured":"Farach-Colton, M., Ferragina, P., Muthukrishnan, S.: On the sorting-complexity of suffix tree construction. Journal of the ACM 47(6), 987\u20131011 (2000)","journal-title":"Journal of the ACM"},{"issue":"760","key":"1_CR8","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1126\/science.155.3760.279","volume":"155","author":"WM Fitch","year":"1967","unstructured":"Fitch, W.M., Margoliash, E., et al.: Construction of phylogenetic trees. Science 155(760), 279\u2013284 (1967)","journal-title":"Science"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Flouri, T., Giaquinta, E., Kobert, K., Ukkonen, E.: Longest common substrings with k mismatches. arXiv preprint (2014). arXiv:1409.1694","DOI":"10.1016\/j.ipl.2015.03.006"},{"key":"1_CR10","unstructured":"Grabowski, S.: A note on the longest common substring with $$ k $$-mismatches problem. arXiv preprint (2014). arXiv:1409.7217"},{"key":"1_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees and sequences: computer science and computational biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees and sequences: computer science and computational biology. University Press, Cambridge (1997)"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1093\/bib\/bbt083","volume":"15","author":"B Haubold","year":"2014","unstructured":"Haubold, B.: Alignment-free phylogenetics and population genetics. Briefings in Bioinformatics 15(3), 407\u2013418 (2014)","journal-title":"Briefings in Bioinformatics"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Horwege, S., Lindner, S., Boden, M., Hatje, K., Kollmar, M., Leimeister, C.-A., Morgenstern, B.: Spaced words and kmacs: fast alignment-free sequence comparison based on inexact word matches. Nucleic Acids Research (2014)","DOI":"10.1093\/nar\/gku398"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Leimeister, C.-A., Morgenstern, B.: kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison. Bioinformatics (2014)","DOI":"10.1093\/bioinformatics\/btu331"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/321941.321946","volume":"23","author":"EM McCreight","year":"1976","unstructured":"McCreight, E.M.: A space-economical suffix tree construction algorithm. Journal of the ACM 23(2), 262\u2013272 (1976)","journal-title":"Journal of the ACM"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. In: STOC, pp. 114\u2013122 (1981)","DOI":"10.1145\/800076.802464"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Song, K., Ren, J., Reinert, G., Deng, M., Waterman, M.S., Sun, F.: New developments of alignment-free sequence comparison: measures, statistics and next-generation sequencing. Briefings in Bioinformatics (2013)","DOI":"10.1093\/bib\/bbt067"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1089\/cmb.2006.13.336","volume":"13","author":"I Ulitsky","year":"2006","unstructured":"Ulitsky, I., Burstein, D., Tuller, T., Chor, B.: The average common substring approach to phylogenomic reconstruction. Journal of Computational Biology 13(2), 336\u2013350 (2006)","journal-title":"Journal of Computational Biology"},{"issue":"4","key":"1_CR19","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1093\/bioinformatics\/btg005","volume":"19","author":"S Vinga","year":"2003","unstructured":"Vinga, S., Almeida, J.: Alignment-free sequence comparison - qa review. Bioinformatics 19(4), 513\u2013523 (2003)","journal-title":"Bioinformatics"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Weiner, P.: Linear pattern matching algorithms. In: Switching and Automata Theory, pp. 1\u201311 (1973)","DOI":"10.1109\/SWAT.1973.13"},{"issue":"2","key":"1_CR21","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/0022-5193(65)90083-4","volume":"8","author":"E Zuckerkandl","year":"1965","unstructured":"Zuckerkandl, E., Pauling, L.: Molecules as documents of evolutionary history. Journal of Theoretical Biology 8(2), 357\u2013366 (1965)","journal-title":"Journal of Theoretical Biology"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16706-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T00:02:29Z","timestamp":1676937749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16706-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319167053","9783319167060"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16706-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"26 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}