{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T14:27:17Z","timestamp":1767968837895,"version":"3.49.0"},"reference-count":9,"publisher":"Oxford University Press (OUP)","issue":"18","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,9,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: The search for short words that are absent in the genome of one or more organisms (neverwords, also known as nullomers) is attracting growing interest because of the impact they may have in recent molecular biology applications. keeSeek is able to find absent sequences with primer-like features, which can be used as unique labels for exogenously inserted DNA fragments to recover their exact position into the genome using PCR techniques. The main differences with respect to previously developed tools for neverwords generation are (i) calculation of the distance from the reference genome, in terms of number of mismatches, and selection of the most distant sequences that will have a low probability to anneal unspecifically; (ii) application of a series of filters to discard candidates not suitable to be used as PCR primers. KeeSeek has been implemented in C++ and CUDA (Compute Unified Device Architecture) to work in a General-Purpose Computing on Graphics Processing Units (GPGPU) environment.<\/jats:p>\n               <jats:p>Availability and implementation: Freely available under the Q Public License at http:\/\/www.medcomp.medicina.unipd.it\/main_site\/doku.php?id=keeseek<\/jats:p>\n               <jats:p>Contact: \u00a0stefano.toppo@unipd.it<\/jats:p>\n               <jats:p>Supplementary information: \u00a0Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btu312","type":"journal-article","created":{"date-parts":[[2014,5,28]],"date-time":"2014-05-28T00:15:16Z","timestamp":1401236116000},"page":"2662-2664","source":"Crossref","is-referenced-by-count":10,"title":["keeSeek: searching distant non-existing words in genomes for PCR-based applications"],"prefix":"10.1093","volume":"30","author":[{"given":"Marco","family":"Falda","sequence":"first","affiliation":[{"name":"1 Department of Molecular Medicine, University of Padova, Padova, I-35131, Italy and 2 Department of Computational Biology, Edmund Mach Foundation, S. Michele All'Adige, I-38010 (TN), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Fontana","sequence":"additional","affiliation":[{"name":"1 Department of Molecular Medicine, University of Padova, Padova, I-35131, Italy and 2 Department of Computational Biology, Edmund Mach Foundation, S. Michele All'Adige, I-38010 (TN), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Barzon","sequence":"additional","affiliation":[{"name":"1 Department of Molecular Medicine, University of Padova, Padova, I-35131, Italy and 2 Department of Computational Biology, Edmund Mach Foundation, S. Michele All'Adige, I-38010 (TN), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Toppo","sequence":"additional","affiliation":[{"name":"1 Department of Molecular Medicine, University of Padova, Padova, I-35131, Italy and 2 Department of Computational Biology, Edmund Mach Foundation, S. Michele All'Adige, I-38010 (TN), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Lavezzo","sequence":"additional","affiliation":[{"name":"1 Department of Molecular Medicine, University of Padova, Padova, I-35131, Italy and 2 Department of Computational Biology, Edmund Mach Foundation, S. Michele All'Adige, I-38010 (TN), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2014,5,27]]},"reference":[{"key":"2023012711554468700_btu312-B1","doi-asserted-by":"crossref","first-page":"1431","DOI":"10.1038\/nm.2057","article-title":"Comprehensive genomic access to vector integration in clinical gene therapy","volume":"15","author":"Gabriel","year":"2009","journal-title":"Nat. Med."},{"key":"2023012711554468700_btu312-B2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/j.tibtech.2013.04.004","article-title":"ZFN, TALEN, and CRISPR\/Cas-based methods for genome engineering","volume":"31","author":"Gaj","year":"2013","journal-title":"Trends Biotechnol."},{"key":"2023012711554468700_btu312-B3","doi-asserted-by":"crossref","first-page":"e16065","DOI":"10.1371\/journal.pone.0016065","article-title":"Minimal absent words in prokaryotic and eukaryotic genomes","volume":"6","author":"Garcia","year":"2011","journal-title":"PLoS One"},{"key":"2023012711554468700_btu312-B4","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/j.jflm.2013.02.003","article-title":"Safeguarding forensic DNA reference samples with nullomer barcodes","volume":"20","author":"Goswami","year":"2013","journal-title":"J. Forensic Leg. Med."},{"key":"2023012711554468700_btu312-B5","first-page":"355","article-title":"Absent sequences: nullomers and primes","volume":"12","author":"Hampikian","year":"2007","journal-title":"Pac. Symp. Biocomput."},{"key":"2023012711554468700_btu312-B6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1186\/1471-2105-9-167","article-title":"Efficient computation of absent words in genomic sequences","volume":"9","author":"Herold","year":"2008","journal-title":"BMC Bioinformatics"},{"key":"2023012711554468700_btu312-B7","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0022-2836(70)90057-4","article-title":"A general method applicable to the search for similarities in the amino acid sequence of two proteins","volume":"48","author":"Needleman","year":"1970","journal-title":"J. Mol. Biol."},{"key":"2023012711554468700_btu312-B8","first-page":"185","article-title":"Flexible sequence similarity searching with the FASTA3 program package","volume":"132","author":"Pearson","year":"2000","journal-title":"Methods Mol. Biol."},{"key":"2023012711554468700_btu312-B9","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1016\/j.ipl.2010.05.008","article-title":"Efficient computation of shortest absent words in a genomic sequence","volume":"110","author":"Wu","year":"2010","journal-title":"Inf. Process. Lett"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/18\/2662\/48929546\/bioinformatics_30_18_2662.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/30\/18\/2662\/48929546\/bioinformatics_30_18_2662.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T12:39:47Z","timestamp":1674823187000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/30\/18\/2662\/2475409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,27]]},"references-count":9,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2014,9,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btu312","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2014,9,15]]},"published":{"date-parts":[[2014,5,27]]}}}