{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T18:08:57Z","timestamp":1790964537858,"version":"4.1.0"},"reference-count":37,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational Biology"],"published-print":{"date-parts":[[2022,2,1]]},"abstract":"<jats:p>\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -mer-based methods are widely used in bioinformatics, but there are many gaps in our understanding of their statistical properties. Here, we consider the simple model where a sequence\n                    <jats:italic toggle=\"yes\">S<\/jats:italic>\n                    (e.g., a genome or a read) undergoes a simple mutation process through which each nucleotide is mutated independently with some probability\n                    <jats:italic toggle=\"yes\">r<\/jats:italic>\n                    , under the assumption that there are no spurious\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -mer matches. How does this process affect the\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -mers of\n                    <jats:italic toggle=\"yes\">S<\/jats:italic>\n                    ? We derive the expectation and variance of the number of mutated\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -mers and of the number of islands (a maximal interval of mutated\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -mers) and oceans (a maximal interval of nonmutated\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -mers). We then derive hypothesis tests and confidence intervals (CIs) for\n                    <jats:italic toggle=\"yes\">r<\/jats:italic>\n                    given an observed number of mutated\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -mers, or, alternatively, given the Jaccard similarity (with or without MinHash). We demonstrate the usefulness of our results using a few select applications: obtaining a CI to supplement the Mash distance point estimate, filtering out reads during alignment by Minimap2, and rating long-read alignments to a de Bruijn graph by Jabba.\n                  <\/jats:p>","DOI":"10.1089\/cmb.2021.0431","type":"journal-article","created":{"date-parts":[[2022,2,2]],"date-time":"2022-02-02T15:47:41Z","timestamp":1643816861000},"page":"155-168","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":47,"title":["The Statistics of\n                    <i>k<\/i>\n                    -mers from a Sequence Undergoing a Simple Mutation Process Without Spurious Matches"],"prefix":"10.1177","volume":"29","author":[{"given":"Antonio","family":"Blanca","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, and The Pennsylvania State University, University Park, Pennsylvania, USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert S.","family":"Harris","sequence":"additional","affiliation":[{"name":"Department of Biology, The Pennsylvania State University, University Park, Pennsylvania, USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Koslicki","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, and The Pennsylvania State University, University Park, Pennsylvania, USA."},{"name":"Department of Biology, The Pennsylvania State University, University Park, Pennsylvania, USA."},{"name":"Huck Institutes of the Life Sciences, The Pennsylvania State University, University Park, Pennsylvania, USA."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3143-594X","authenticated-orcid":false,"given":"Paul","family":"Medvedev","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, and The Pennsylvania State University, University Park, Pennsylvania, USA."},{"name":"Huck Institutes of the Life Sciences, The Pennsylvania State University, University Park, Pennsylvania, USA."},{"name":"Department of Biochemistry and Molecular Biology, The Pennsylvania State University, University Park, Pennsylvania, USA."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2022,2,16]]},"reference":[{"key":"e_1_3_5_2_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2012.0021"},{"key":"e_1_3_5_3_1","first-page":"21","volume-title":"In: Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No. 97TB100171)","author":"Broder A.Z.","year":"1997","unstructured":"Broder A.Z. 1997. On the resemblance and containment of documents, pp. 21\u201329. In: Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No. 97TB100171). IEEE, Salerno, Italy."},{"key":"e_1_3_5_4_1","first-page":"1256","article-title":"Measurement of bacterial replication rates in microbial communities. Nat","volume":"34","author":"Brown C.T.","year":"2016","unstructured":"Brown C.T., , Olm M.R., , Thomas B.C., , and Banfield J.F. 2016. Measurement of bacterial replication rates in microbial communities. Nat. Biotechnol. 34, 1256.","journal-title":"Biotechnol"},{"key":"e_1_3_5_5_1","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1009213286"},{"key":"e_1_3_5_6_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2012.0277"},{"key":"e_1_3_5_7_1","volume-title":"Statistical Inference, Vol. 2","author":"Casella G.","year":"2002","unstructured":"Casella G., , and Berger R.L. 2002. Statistical Inference, Vol. 2. Duxbury Pacific Grove, CA."},{"key":"e_1_3_5_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.isci.2019.07.011"},{"key":"e_1_3_5_9_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12864-015-1647-5"},{"key":"e_1_3_5_10_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"e_1_3_5_11_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz662"},{"key":"e_1_3_5_12_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2009.0106"},{"key":"e_1_3_5_13_1","doi-asserted-by":"publisher","DOI":"10.1215\/S0012-7094-48-01568-3"},{"key":"e_1_3_5_14_1","volume-title":"In: International Conference on Research in Computational Molecular Biology","author":"Jain C.","year":"2017","unstructured":"Jain C., , Dilthey A., , Koren S., et al. 2017. A fast approximate algorithm for mapping long reads to large reference databases, pp. 66\u201381. In: International Conference on Research in Computational Molecular Biology. Ed: S. Cenk Sahinalp. Springer, Hongkong."},{"key":"e_1_3_5_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0888-7543(88)90007-9"},{"key":"e_1_3_5_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty191"},{"key":"e_1_3_5_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkx351"},{"key":"e_1_3_5_18_1","doi-asserted-by":"publisher","DOI":"10.1198\/0003130043303"},{"key":"e_1_3_5_19_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13015-016-0075-7"},{"key":"e_1_3_5_20_1","first-page":"5","article-title":"Estimating evolutionary distances between genomic sequences from spaced-word matches. Algorithms Mol","volume":"10","author":"Morgenstern B.","year":"2015","unstructured":"Morgenstern B., , Zhu B., , Horwege S., , and Leimeister C.A. 2015. Estimating evolutionary distances between genomic sequences from spaced-word matches. Algorithms Mol. Biol. 10, 5.","journal-title":"Biol"},{"key":"e_1_3_5_21_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-019-1841-x"},{"key":"e_1_3_5_22_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-016-0997-x"},{"key":"e_1_3_5_23_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2009.0198"},{"key":"e_1_3_5_24_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0228070"},{"key":"e_1_3_5_25_1","doi-asserted-by":"publisher","DOI":"10.1214\/11-PS182"},{"key":"e_1_3_5_26_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw321"},{"key":"e_1_3_5_27_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-019-1632-4"},{"key":"e_1_3_5_28_1","volume-title":"BioRxiv","author":"Schwengers O.","year":"2019","unstructured":"Schwengers O., , Hain T., , Chakraborty T., , and Goesmann A. 2019. Referenceseeker: Rapid determination of appropriate reference genomes. BioRxiv. Vol. 863621."},{"key":"e_1_3_5_29_1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.3442"},{"key":"e_1_3_5_30_1","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbt067"},{"key":"e_1_3_5_31_1","volume-title":"bioRxiv","author":"Standage D.S.","year":"2019","unstructured":"Standage D.S., , Brown C.T., , and Hormozdiari F. 2019. Kevlar: A mapping-free framework for accurate discovery of de novo variants. bioRxiv. Vol. 549154."},{"key":"e_1_3_5_32_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty641"},{"key":"e_1_3_5_33_1","doi-asserted-by":"publisher","DOI":"10.1186\/s12864-019-6310-0"},{"key":"e_1_3_5_34_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-019-1885-y"},{"key":"e_1_3_5_35_1","volume-title":"All of Statistics: A Concise Course in Statistical Inference","author":"Wasserman L.","year":"2013","unstructured":"Wasserman L. 2013. All of Statistics: A Concise Course in Statistical Inference. Springer Science & Business Media, Berlin, Germany."},{"key":"e_1_3_5_36_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1927.10502953"},{"key":"e_1_3_5_37_1","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2014-15-3-r46"},{"key":"e_1_3_5_38_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti658"}],"container-title":["Journal of Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1089\/cmb.2021.0431","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1089\/cmb.2021.0431","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1089\/cmb.2021.0431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T16:18:22Z","timestamp":1777393102000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1089\/cmb.2021.0431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,1]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,2,1]]}},"alternative-id":["10.1089\/cmb.2021.0431"],"URL":"https:\/\/doi.org\/10.1089\/cmb.2021.0431","relation":{"has-preprint":[{"id-type":"doi","id":"10.1101\/2021.01.15.426881","asserted-by":"object"}]},"ISSN":["1066-5277","1557-8666"],"issn-type":[{"value":"1066-5277","type":"print"},{"value":"1557-8666","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,1]]}}}