@article {382, title = {VISMapper: ultra-fast exhaustive cartography of viral insertion sites for gene therapy.}, journal = {BMC Bioinformatics}, volume = {18}, year = {2017}, month = {2017 Sep 20}, pages = {421}, abstract = {

BACKGROUND: The possibility of integrating viral vectors to become a persistent part of the host genome makes them a crucial element of clinical gene therapy. However, viral integration has associated risks, such as the unintentional activation of oncogenes that can result in cancer. Therefore, the analysis of integration sites of retroviral vectors is a crucial step in developing safer vectors for therapeutic use.

RESULTS: Here we present VISMapper, a vector integration site analysis web server, to analyze next-generation sequencing data for retroviral vector integration sites. VISMapper can be found at: http://vismapper.babelomics.org .

CONCLUSIONS: Because it uses novel mapping algorithms VISMapper is remarkably faster than previous available programs. It also provides a useful graphical interface to analyze the integration sites found in the genomic context.

}, keywords = {Base Sequence, Genetic Therapy, Genetic Vectors, High-Throughput Nucleotide Sequencing, Humans, Internet, User-Computer Interface, Virus Integration}, issn = {1471-2105}, doi = {10.1186/s12859-017-1837-z}, author = {Juanes, Jos{\'e} M and Gallego, Asunci{\'o}n and T{\'a}rraga, Joaqu{\'\i}n and Chaves, Felipe J and Marin-Garcia, Pablo and Medina, Ignacio and Arnau, Vicente and Dopazo, Joaquin} } @article {472, title = {Fast inexact mapping using advanced tree exploration on backward search methods.}, journal = {BMC Bioinformatics}, volume = {16}, year = {2015}, month = {2015 Jan 28}, pages = {18}, abstract = {

BACKGROUND: Short sequence mapping methods for Next Generation Sequencing consist on a combination of seeding techniques followed by local alignment based on dynamic programming approaches. Most seeding algorithms are based on backward search alignment, using the Burrows Wheeler Transform, the Ferragina and Manzini Index or Suffix Arrays. All these backward search algorithms have excellent performance, but their computational cost highly increases when allowing errors. In this paper, we discuss an inexact mapping algorithm based on pruning strategies for search tree exploration over genomic data.

RESULTS: The proposed algorithm achieves a 13x speed-up over similar algorithms when allowing 6 base errors, including insertions, deletions and mismatches. This algorithm can deal with 400 bps reads with up to 9 errors in a high quality Illumina dataset. In this example, the algorithm works as a preprocessor that reduces by 55\% the number of reads to be aligned. Depending on the aligner the overall execution time is reduced between 20-40\%.

CONCLUSIONS: Although not intended as a complete sequence mapping tool, the proposed algorithm could be used as a preprocessing step to modern sequence mappers. This step significantly reduces the number reads to be aligned, accelerating overall alignment time. Furthermore, this algorithm could be used for accelerating the seeding step of already available sequence mappers. In addition, an out-of-core index has been implemented for working with large genomes on systems without expensive memory configurations.

}, keywords = {Algorithms, Genome, Human, Genomics, High-Throughput Nucleotide Sequencing, Humans, Sequence Alignment, Sequence Analysis, DNA, Software}, issn = {1471-2105}, doi = {10.1186/s12859-014-0438-3}, author = {Salavert, Jos{\'e} and Tom{\'a}s, Andr{\'e}s and T{\'a}rraga, Joaqu{\'\i}n and Medina, Ignacio and Dopazo, Joaquin and Blanquer, Ignacio} }