{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T03:53:16Z","timestamp":1772077996461,"version":"3.50.1"},"reference-count":6,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2018,7,28]],"date-time":"2018-07-28T00:00:00Z","timestamp":1532736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100009894","name":"Lodz University of Technology","doi-asserted-by":"publisher","award":["501\/12-24-1-5418"],"award-info":[{"award-number":["501\/12-24-1-5418"]}],"id":[{"id":"10.13039\/501100009894","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,2,15]]},"abstract":"Abstract<\/jats:title>\n \n Motivation<\/jats:title>\n Genome-to-genome comparisons require designating anchor points, which are given by Maximum Exact Matches (MEMs) between their sequences. For large genomes this is a challenging problem and the performance of existing solutions, even in parallel regimes, is not quite satisfactory.<\/jats:p>\n <\/jats:sec>\n \n Results<\/jats:title>\n We present a new algorithm, copMEM, that allows to sparsely sample both input genomes, with sampling steps being coprime. Despite being a single-threaded implementation, copMEM computes all MEMs of minimum length 100 between the human and mouse genomes in less than 2\u2009minutes, using 7 GB of RAM memory.<\/jats:p>\n <\/jats:sec>\n \n Availability and implementation<\/jats:title>\n https:\/\/github.com\/wbieniec\/copmem<\/jats:p>\n <\/jats:sec>\n \n Supplementary data<\/jats:title>\n Supplementary data are available at Bioinformatics online.<\/jats:p>\n <\/jats:sec>","DOI":"10.1093\/bioinformatics\/bty670","type":"journal-article","created":{"date-parts":[[2018,7,27]],"date-time":"2018-07-27T11:09:29Z","timestamp":1532689769000},"page":"677-678","source":"Crossref","is-referenced-by-count":13,"title":["copMEM: finding maximal exact matches via sampling both genomes"],"prefix":"10.1093","volume":"35","author":[{"given":"Szymon","family":"Grabowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1708-5760","authenticated-orcid":false,"given":"Wojciech","family":"Bieniecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2018,7,28]]},"reference":[{"key":"2023051511010825800_bty670-B1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S1570-8667(03)00065-0","article-title":"Replacing suffix trees with enhanced suffix arrays","volume":"2","author":"Abouelhoda","year":"2004","journal-title":"J. Discrete Algorithms"},{"key":"2023051511010825800_bty670-B2","doi-asserted-by":"crossref","first-page":"e0189960.","DOI":"10.1371\/journal.pone.0189960","article-title":"Comparing fixed sampling with minimizer sampling when using k-mer indexes to find maximal exact matches","volume":"13","author":"Almutairy","year":"2018","journal-title":"PLoS One"},{"key":"2023051511010825800_bty670-B3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1093\/bioinformatics\/btu687","article-title":"E-MEM: efficient computation of maximal exact matches for very large genomes","volume":"31","author":"Khiste","year":"2015","journal-title":"Bioinformatics"},{"key":"2023051511010825800_bty670-B4","doi-asserted-by":"crossref","first-page":"R12.","DOI":"10.1186\/gb-2004-5-2-r12","article-title":"Versatile and open software for comparing large genomes","volume":"5","author":"Kurtz","year":"2004","journal-title":"Genome Biol"},{"key":"2023051511010825800_bty670-B5","doi-asserted-by":"crossref","first-page":"3363","DOI":"10.1093\/bioinformatics\/bth408","article-title":"Reducing storage requirements for biological sequence comparison","volume":"20","author":"Roberts","year":"2004","journal-title":"Bioinformatics"},{"key":"2023051511010825800_bty670-B6","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1093\/bioinformatics\/btt042","article-title":"essaMEM: finding maximal exact matches using enhanced sparse suffix arrays","volume":"29","author":"Vyverman","year":"2013","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/35\/4\/677\/50321448\/bioinformatics_35_4_677.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/35\/4\/677\/50321448\/bioinformatics_35_4_677.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T11:01:16Z","timestamp":1684148476000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/35\/4\/677\/5061159"}},"subtitle":[],"editor":[{"given":"John","family":"Hancock","sequence":"additional","affiliation":[{"name":"Institute of Applied Computer Science, Lodz University of Technology, \u0141\u00f3d\u017a, Poland"}],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,7,28]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,2,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bty670","relation":{},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"value":"1367-4803","type":"print"},{"value":"1367-4811","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2019,2,15]]},"published":{"date-parts":[[2018,7,28]]}}}