{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T21:47:30Z","timestamp":1722721650432},"reference-count":19,"publisher":"Oxford University Press (OUP)","issue":"22","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,11,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Motivation: Sequence mapping is the cornerstone of modern genomics. However, most existing sequence mapping algorithms are insufficiently general.<\/jats:p>\n               <jats:p>Results: We introduce context schemes: a method that allows the unambiguous recognition of a reference base in a query sequence by testing the query for substrings from an algorithmically defined set. Context schemes only map when there is a unique best mapping, and define this criterion uniformly for all reference bases. Mappings under context schemes can also be made stable, so that extension of the query string (e.g. by increasing read length) will not alter the mapping of previously mapped positions. Context schemes are general in several senses. They natively support the detection of arbitrary complex, novel rearrangements relative to the reference. They can scale over orders of magnitude in query sequence length. Finally, they are trivially extensible to more complex reference structures, such as graphs, that incorporate additional variation. We demonstrate empirically the existence of high-performance context schemes, and present efficient context scheme mapping algorithms.<\/jats:p>\n               <jats:p>Availability and implementation: The software test framework created for this study is available from https:\/\/registry.hub.docker.com\/u\/adamnovak\/sequence-graphs\/.<\/jats:p>\n               <jats:p>Contact: \u00a0anovak@soe.ucsc.edu<\/jats:p>\n               <jats:p>Supplementary information: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btv435","type":"journal-article","created":{"date-parts":[[2015,7,29]],"date-time":"2015-07-29T00:29:38Z","timestamp":1438129778000},"page":"3569-3576","source":"Crossref","is-referenced-by-count":5,"title":["Canonical, stable, general mapping using context schemes"],"prefix":"10.1093","volume":"31","author":[{"given":"Adam M.","family":"Novak","sequence":"first","affiliation":[{"name":"1 UC Santa Cruz Genomics Institute, 1156 High Street, Santa Cruz, CA 95064 and"}]},{"given":"Yohei","family":"Rosen","sequence":"additional","affiliation":[{"name":"2 NYU School of Medicine, 550 First Avenue, New York, NY 10016, USA"}]},{"given":"David","family":"Haussler","sequence":"additional","affiliation":[{"name":"1 UC Santa Cruz Genomics Institute, 1156 High Street, Santa Cruz, CA 95064 and"}]},{"given":"Benedict","family":"Paten","sequence":"additional","affiliation":[{"name":"1 UC Santa Cruz Genomics Institute, 1156 High Street, Santa Cruz, CA 95064 and"}]}],"member":"286","published-online":{"date-parts":[[2015,7,27]]},"reference":[{"key":"2023020202342098900_btv435-B1","doi-asserted-by":"crossref","first-page":"e1001091","DOI":"10.1371\/journal.pbio.1001091","article-title":"Modernizing reference genome assemblies","volume":"9","author":"Church","year":"2011","journal-title":"PLoS Biol."},{"key":"2023020202342098900_btv435-B2","doi-asserted-by":"crossref","first-page":"2369","DOI":"10.1093\/nar\/27.11.2369","article-title":"Alignment of whole genomes","volume":"27","author":"Delcher","year":"1999","journal-title":"Nucleic Acids Res."},{"key":"2023020202342098900_btv435-B3","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1038\/ng.3257","article-title":"Improved genome inference in the MHC using a population reference graph","volume":"47","author":"Dilthey","year":"2014","journal-title":"Nat. Genet."},{"key":"2023020202342098900_btv435-B4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1093\/bioinformatics\/bts635","article-title":"Star: ultrafast universal RNA-seq aligner","volume":"29","author":"Dobin","year":"2013","journal-title":"Bioinformatics"},{"key":"2023020202342098900_btv435-B5","doi-asserted-by":"crossref","first-page":"2077","DOI":"10.1101\/gr.174920.114","article-title":"Alignathon: a competitive assessment of whole-genome alignment methods","volume":"24","author":"Earl","year":"2014","journal-title":"Genome Res."},{"key":"2023020202342098900_btv435-B6","article-title":"Improved pairwise alignment of genomic DNA","author":"Harris","year":"2007"},{"key":"2023020202342098900_btv435-B7","doi-asserted-by":"crossref","first-page":"R25","DOI":"10.1186\/gb-2009-10-3-r25","article-title":"Ultrafast and memory-efficient alignment of short DNA sequences to the human genome","volume":"10","author":"Langmead","year":"2009","journal-title":"Genome Biol."},{"key":"2023020202342098900_btv435-B8","article-title":"Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM","author":"Li","year":"2013","journal-title":"arXiv preprint arXiv:1303.3997"},{"key":"2023020202342098900_btv435-B9","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1093\/bioinformatics\/btp698","article-title":"Fast and accurate long-read alignment with burrows\u2013wheeler transform","volume":"26","author":"Li","year":"2010","journal-title":"Bioinformatics"},{"key":"2023020202342098900_btv435-B10","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1093\/bib\/bbq015","article-title":"A survey of sequence alignment algorithms for next-generation sequencing","volume":"11","author":"Li","year":"2010","journal-title":"Brief. Bioinform."},{"key":"2023020202342098900_btv435-B11","doi-asserted-by":"crossref","first-page":"1851","DOI":"10.1101\/gr.078212.108","article-title":"Mapping short DNA sequencing reads and calling variants using mapping quality scores","volume":"18","author":"Li","year":"2008","journal-title":"Genome Res."},{"key":"2023020202342098900_btv435-B12","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/978-3-540-74126-8_27","article-title":"Computability of models for sequence assembly","volume-title":"Algorithms in Bioinformatics","author":"Medvedev","year":"2007"},{"key":"2023020202342098900_btv435-B13","doi-asserted-by":"crossref","first-page":"D64","DOI":"10.1093\/nar\/gks1048","article-title":"The UCSC genome browser database: extensions and updates 2013","volume":"41","author":"Meyer","year":"2013","journal-title":"Nucleic Acids Res."},{"key":"2023020202342098900_btv435-B14","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1089\/cmb.2010.0252","article-title":"Cactus graphs for genome comparisons","volume":"18","author":"Paten","year":"2011","journal-title":"J. Comput. Biol."},{"key":"2023020202342098900_btv435-B15","article-title":"Mapping to a reference genome structure","author":"Paten","year":"2014","journal-title":"arXiv preprint arXiv:1404.5010"},{"key":"2023020202342098900_btv435-B16","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1186\/1471-2164-13-341","article-title":"A tale of three next generation sequencing platforms: comparison of ion torrent, pacific biosciences and illumina MiSeq sequencers","volume":"13","author":"Quail","year":"2012","journal-title":"BMC Genomics"},{"key":"2023020202342098900_btv435-B17","article-title":"Genome reference consortium","volume-title":"The NCBI Handbook [Internet]","author":"Schneider","year":"2013","edition":"2nd edn."},{"key":"2023020202342098900_btv435-B18","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/nar\/29.1.308","article-title":"DBSNP: the NCBI database of genetic variation","volume":"29","author":"Sherry","year":"2001","journal-title":"Nucleic Acids Res."},{"key":"2023020202342098900_btv435-B19","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1038\/44853","article-title":"Complete sequence and gene map of a human major histocompatibility complex","volume":"401","author":"The MHC Sequencing Consortium","year":"1999","journal-title":"Nature"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/31\/22\/3569\/49036224\/bioinformatics_31_22_3569.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/31\/22\/3569\/49036224\/bioinformatics_31_22_3569.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T03:53:32Z","timestamp":1675310012000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/31\/22\/3569\/241446"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,27]]},"references-count":19,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2015,11,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btv435","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2015,11,15]]},"published":{"date-parts":[[2015,7,27]]}}}