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

Falda, M.; Fontana, P.; Barzon, L.; Toppo, S.; Lavezzo, E. (2014). keeSeek: searching distant non-existing words in genomes for PCR-based applications. BIOINFORMATICS, 30 (18): 2662-2664. doi: 10.1093/bioinformatics/btu312 handle: http://hdl.handle.net/10449/25055

keeSeek: searching distant non-existing words in genomes for PCR-based applications

Fontana, Paolo;
2014-01-01

Abstract

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
Settore BIO/11 - BIOLOGIA MOLECOLARE
2014
Falda, M.; Fontana, P.; Barzon, L.; Toppo, S.; Lavezzo, E. (2014). keeSeek: searching distant non-existing words in genomes for PCR-based applications. BIOINFORMATICS, 30 (18): 2662-2664. doi: 10.1093/bioinformatics/btu312 handle: http://hdl.handle.net/10449/25055
File in questo prodotto:
File Dimensione Formato  
2014 B Falda et al.pdf

solo utenti autorizzati

Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 108.99 kB
Formato Adobe PDF
108.99 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10449/25055
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 4
social impact