{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:52:23Z","timestamp":1743148343775,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030800482"},{"type":"electronic","value":"9783030800499"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-80049-9_21","type":"book-chapter","created":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T18:06:14Z","timestamp":1625162774000},"page":"227-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic Models of k-mer Frequencies (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Askar","family":"Gafurov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Vina\u0159","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bro\u0148a","family":"Brejov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,2]]},"reference":[{"issue":"22","key":"21_CR1","doi-asserted-by":"publisher","first-page":"3584","DOI":"10.1093\/bioinformatics\/btv419","volume":"31","author":"K B\u0159inda","year":"2015","unstructured":"B\u0159inda, K., Sykulski, M., Kucherov, G.: Spaced seeds improve k-mer-based metagenomic classification. Bioinformatics 31(22), 3584\u20133592 (2015)","journal-title":"Bioinformatics"},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10142-018-0647-3","volume":"19","author":"CKK Chan","year":"2019","unstructured":"Chan, C.K.K., et al.: A differential k-mer analysis pipeline for comparing RNA-seq transcriptome and meta-transcriptome datasets without a reference. Funct. Integr. Genomics 19(2), 363\u2013371 (2019)","journal-title":"Funct. Integr. Genomics"},{"key":"21_CR3","unstructured":"Chikhi, R., Holub, J., Medvedev, P.: Data structures to represent sets of k-long DNA sequences. arXiv preprint arXiv:1903.12312 (2019)"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1093\/bioinformatics\/btt310","volume":"30","author":"R Chikhi","year":"2014","unstructured":"Chikhi, R., Medvedev, P.: Informed and automated k-mer size selection for genome assembly. Bioinformatics 30(1), 31\u201337 (2014)","journal-title":"Bioinformatics"},{"issue":"1","key":"21_CR5","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1186\/s13015-014-0029-x","volume":"10","author":"M Comin","year":"2015","unstructured":"Comin, M., Leoni, A., Schimd, M.: Clustering of reads with alignment-free measures and quality values. Algorithms Mol. Biol. 10(1), 4 (2015)","journal-title":"Algorithms Mol. Biol."},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-23826-5_20","volume-title":"String Processing and Information Retrieval","author":"M Hozza","year":"2015","unstructured":"Hozza, M., Vina\u0159, T., Brejov\u00e1, B.: How big is that genome? Estimating genome size and coverage from k-mer abundance spectra. In: Iliopoulos, C., Puglisi, S., Yilmaz, E. (eds.) SPIRE 2015. LNCS, vol. 9309, pp. 199\u2013209. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23826-5_20"},{"issue":"11","key":"21_CR7","doi-asserted-by":"publisher","first-page":"R116","DOI":"10.1186\/gb-2010-11-11-r116","volume":"11","author":"DR Kelley","year":"2010","unstructured":"Kelley, D.R., Schatz, M.C., Salzberg, S.L.: Quake: quality-aware detection and correction of sequencing errors. Genome Biol. 11(11), R116 (2010)","journal-title":"Genome Biol."},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/gb-2009-10-3-r25","volume":"10","author":"B Langmead","year":"2009","unstructured":"Langmead, B., Trapnell, C., Pop, M., Salzberg, S.L.: Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol. 10(3), 1\u201310 (2009)","journal-title":"Genome Biol."},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.2174\/1389202919666181026101326","volume":"20","author":"SC Manekar","year":"2019","unstructured":"Manekar, S.C., Sathe, S.R.: Estimating the k-mer coverage frequencies in genomic datasets: a comparative assessment of the state-of-the-art. Curr. Genomics 20(1), 2\u201315 (2019)","journal-title":"Curr. Genomics"},{"issue":"6","key":"21_CR10","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1093\/bioinformatics\/btr011","volume":"27","author":"G Mar\u00e7ais","year":"2011","unstructured":"Mar\u00e7ais, G., Kingsford, C.: A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics 27(6), 764\u2013770 (2011)","journal-title":"Bioinformatics"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1101\/gr.260604.119","volume":"31","author":"C Marchet","year":"2021","unstructured":"Marchet, C., Boucher, C., Puglisi, S.J., Medvedev, P., Salson, M., Chikhi, R.: Data structures based on k-mers for querying large collections of sequencing data sets. Genome Res. 31(1), 1\u201312 (2021)","journal-title":"Genome Res."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Marchet, C., Iqbal, Z., Gautheret, D., Salson, M., Chikhi, R.: REINDEER: efficient indexing of k-mer presence and abundance in sequencing datasets. Bioinformatics 36(Supplement_1), i177\u2013i185 (2020)","DOI":"10.1093\/bioinformatics\/btaa487"},{"issue":"24","key":"21_CR13","doi-asserted-by":"publisher","first-page":"3541","DOI":"10.1093\/bioinformatics\/btu713","volume":"30","author":"P Melsted","year":"2014","unstructured":"Melsted, P., Halld\u00f3rsson, B.V.: KmerStream: streaming algorithms for k-mer abundance estimation. Bioinformatics 30(24), 3541\u20133547 (2014)","journal-title":"Bioinformatics"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Menzel, M., Hurka, S., Glasenhardt, S., Gogol-D\u00f6ring, A.: NoPeak: k-mer-based motif discovery in ChIP-Seq data without peak calling. Bioinformatics 37(5), 596\u2013602 (2020)","DOI":"10.1093\/bioinformatics\/btaa845"},{"issue":"1","key":"21_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1186\/s13015-015-0032-x","volume":"10","author":"B Morgenstern","year":"2015","unstructured":"Morgenstern, B., Zhu, B., Horwege, S., Leimeister, A.A.: Estimating evolutionary distances between genomic sequences from spaced-word matches. Algorithms Mol. Biol. 10(1), 5 (2015)","journal-title":"Algorithms Mol. Biol."},{"issue":"1","key":"21_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s42003-018-0023-9","volume":"1","author":"G Narzisi","year":"2018","unstructured":"Narzisi, G., et al.: Genome-wide somatic variant calling using localized colored de Bruijn graphs. Commun. Biol. 1(1), 1\u20139 (2018)","journal-title":"Commun. Biol."},{"issue":"4","key":"21_CR17","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1038\/nmeth.4197","volume":"14","author":"R Patro","year":"2017","unstructured":"Patro, R., Duggal, G., Love, M.I., Irizarry, R.A., Kingsford, C.: Salmon provides fast and bias-aware quantification of transcript expression. Nature Methods 14(4), 417\u2013419 (2017)","journal-title":"Nature Methods"},{"issue":"5","key":"21_CR18","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1038\/nbt.2862","volume":"32","author":"R Patro","year":"2014","unstructured":"Patro, R., Mount, S.M., Kingsford, C.: Sailfish enables alignment-free isoform quantification from RNA-seq reads using lightweight algorithms. Nature Biotechnol. 32(5), 462\u2013464 (2014)","journal-title":"Nature Biotechnol."},{"issue":"4","key":"21_CR19","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1111\/tpj.12839","volume":"82","author":"V Pe\u0161ka","year":"2015","unstructured":"Pe\u0161ka, V., Fajkus, P., Fojtov\u00e1, M., et al.: Characterisation of an unusual telomere motif (TTTTTTAGGG)n in the plant Cestrum elegans (Solanaceae), a species with a large genome. Plant J. 82(4), 644\u2013654 (2015)","journal-title":"Plant J."},{"key":"21_CR20","doi-asserted-by":"crossref","unstructured":"Pflug, J.M., Holmes, V.R., Burrus, C., Johnston, J.S., Maddison, D.R.: Measuring genome sizes using read-depth, k-mers, and flow cytometry: methodological comparisons in beetles (Coleoptera). G3: Genes Genomes Genet. 10(9), 3047\u20133060 (2020)","DOI":"10.1534\/g3.120.401028"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Ranallo-Benavidez, T.R., Jaron, K.S., Schatz, M.C.: GenomeScope 2.0 and Smudgeplot for reference-free profiling of polyploid genomes. Nature Commun. 11(1), 1\u201310 (2020)","DOI":"10.1038\/s41467-020-14998-3"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"R\u00f6hling, S., Linne, A., Schellhorn, J., Hosseini, M., Dencker, T., Morgenstern, B.: The number of k-mer matches between two DNA sequences as a function of k and applications to estimate phylogenetic distances. Plos One 15(2), e0228070 (2020)","DOI":"10.1371\/journal.pone.0228070"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Shajii, A., Yorukoglu, D., William, Yu, Y., Berger, B.: Fast genotyping of known SNPs through approximate k-mer matching. Bioinformatics 32(17), i538\u2013i544 (2016)","DOI":"10.1093\/bioinformatics\/btw460"},{"issue":"9","key":"21_CR24","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1093\/bioinformatics\/btu023","volume":"30","author":"JT Simpson","year":"2014","unstructured":"Simpson, J.T.: Exploring genome characteristics and sequence quality without a reference. Bioinformatics 30(9), 1228\u20131235 (2014)","journal-title":"Bioinformatics"},{"issue":"1","key":"21_CR25","first-page":"118","volume":"19","author":"The Computational Pan-Genomics Consortium","year":"2018","unstructured":"The Computational Pan-Genomics Consortium: Computational pan-genomics: status, promises and challenges. Briefings Bioinform. 19(1), 118\u2013135 (2018)","journal-title":"Briefings Bioinform."},{"issue":"14","key":"21_CR26","doi-asserted-by":"publisher","first-page":"2202","DOI":"10.1093\/bioinformatics\/btx153","volume":"33","author":"GW Vurture","year":"2017","unstructured":"Vurture, G.W., et al.: GenomeScope: fast reference-free genome profiling from short reads. Bioinformatics 33(14), 2202\u20132204 (2017)","journal-title":"Bioinformatics"},{"issue":"1","key":"21_CR27","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1186\/1471-2164-14-537","volume":"14","author":"D Williams","year":"2013","unstructured":"Williams, D., Trimble, W.L., Shilts, M., Meyer, F., Ochman, H.: Rapid quantification of sequence repeats to resolve the size, structure and contents of bacterial genomes. BMC Genomics 14(1), 537 (2013)","journal-title":"BMC Genomics"},{"issue":"9","key":"21_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/gb-2008-9-9-r137","volume":"9","author":"Y Zhang","year":"2008","unstructured":"Zhang, Y., et al.: Model-based analysis of ChIP-Seq (MACS). Genome Biol. 9(9), 1\u20139 (2008)","journal-title":"Genome Biol."},{"issue":"4","key":"21_CR29","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C Zhu","year":"1997","unstructured":"Zhu, C., Byrd, R.H., Lu, P., Nocedal, J.: Algorithm 778: L-BFGS-B: fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw. 23(4), 550\u2013560 (1997)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Lecture Notes in Computer Science","Connecting with Computability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-80049-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T17:05:41Z","timestamp":1638810341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-80049-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030800482","9783030800499"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-80049-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cie2021.ugent.be\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}