@article {387, title = {HGVA: the Human Genome Variation Archive.}, journal = {Nucleic Acids Res}, volume = {45}, year = {2017}, month = {2017 07 03}, pages = {W189-W194}, abstract = {

High-profile genomic variation projects like the 1000 Genomes project or the Exome Aggregation Consortium, are generating a wealth of human genomic variation knowledge which can be used as an essential reference for identifying disease-causing genotypes. However, accessing these data, contrasting the various studies and integrating those data in downstream analyses remains cumbersome. The Human Genome Variation Archive (HGVA) tackles these challenges and facilitates access to genomic data for key reference projects in a clean, fast and integrated fashion. HGVA provides an efficient and intuitive web-interface for easy data mining, a comprehensive RESTful API and client libraries in Python, Java and JavaScript for fast programmatic access to its knowledge base. HGVA calculates population frequencies for these projects and enriches their data with variant annotation provided by CellBase, a rich and fast annotation solution. HGVA serves as a proof-of-concept of the genome analysis developments being carried out by the University of Cambridge together with UK{\textquoteright}s 100 000 genomes project and the National Institute for Health Research BioResource Rare-Diseases, in particular, deploying open-source for Computational Biology (OpenCB) software platform for storing and analyzing massive genomic datasets.

}, keywords = {Genetic Variation, Genome, Human, Humans, Internet, Software, User-Computer Interface}, issn = {1362-4962}, doi = {10.1093/nar/gkx445}, url = {https://academic.oup.com/nar/article-lookup/doi/10.1093/nar/gkx445}, author = {Lopez, Javier and Coll, Jacobo and Haimel, Matthias and Kandasamy, Swaathi and T{\'a}rraga, Joaqu{\'\i}n and Furio-Tari, Pedro and Bari, Wasim and Bleda, Marta and Rueda, Antonio and Gr{\"a}f, Stefan and Rendon, Augusto and Dopazo, Joaquin and Medina, Ignacio} } @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} }