@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} } @article {512, title = {Discovering the hidden sub-network component in a ranked list of genes or proteins derived from genomic experiments.}, journal = {Nucleic Acids Res}, volume = {40}, year = {2012}, month = {2012 Nov 01}, pages = {e158}, abstract = {

Genomic experiments (e.g. differential gene expression, single-nucleotide polymorphism association) typically produce ranked list of genes. We present a simple but powerful approach which uses protein-protein interaction data to detect sub-networks within such ranked lists of genes or proteins. We performed an exhaustive study of network parameters that allowed us concluding that the average number of components and the average number of nodes per component are the parameters that best discriminate between real and random networks. A novel aspect that increases the efficiency of this strategy in finding sub-networks is that, in addition to direct connections, also connections mediated by intermediate nodes are considered to build up the sub-networks. The possibility of using of such intermediate nodes makes this approach more robust to noise. It also overcomes some limitations intrinsic to experimental designs based on differential expression, in which some nodes are invariant across conditions. The proposed approach can also be used for candidate disease-gene prioritization. Here, we demonstrate the usefulness of the approach by means of several case examples that include a differential expression analysis in Fanconi Anemia, a genome-wide association study of bipolar disorder and a genome-scale study of essentiality in cancer genes. An efficient and easy-to-use web interface (available at http://www.babelomics.org) based on HTML5 technologies is also provided to run the algorithm and represent the network.

}, keywords = {Bipolar Disorder, Fanconi Anemia, Gene Regulatory Networks, Genes, Neoplasm, Genome-Wide Association Study, Genomics, Humans, Protein Interaction Mapping}, issn = {1362-4962}, doi = {10.1093/nar/gks699}, author = {Garc{\'\i}a-Alonso, Luz and Alonso, Roberto and Vidal, Enrique and Amadoz, Alicia and De Maria, Alejandro and Minguez, Pablo and Medina, Ignacio and Dopazo, Joaquin} } @article {539, title = {Phylemon 2.0: a suite of web-tools for molecular evolution, phylogenetics, phylogenomics and hypotheses testing.}, journal = {Nucleic Acids Res}, volume = {39}, year = {2011}, month = {2011 Jul}, pages = {W470-4}, abstract = {

Phylemon 2.0 is a new release of the suite of web tools for molecular evolution, phylogenetics, phylogenomics and hypotheses testing. It has been designed as a response to the increasing demand of molecular sequence analyses for experts and non-expert users. Phylemon 2.0 has several unique features that differentiates it from other similar web resources: (i) it offers an integrated environment that enables evolutionary analyses, format conversion, file storage and edition of results; (ii) it suggests further analyses, thereby guiding the users through the web server; and (iii) it allows users to design and save phylogenetic pipelines to be used over multiple genes (phylogenomics). Altogether, Phylemon 2.0 integrates a suite of 30 tools covering sequence alignment reconstruction and trimming; tree reconstruction, visualization and manipulation; and evolutionary hypotheses testing.

}, keywords = {Evolution, Molecular, Genomics, Internet, Phylogeny, Sequence Alignment, Software}, issn = {1362-4962}, doi = {10.1093/nar/gkr408}, author = {S{\'a}nchez, Rub{\'e}n and Serra, Fran{\c c}ois and T{\'a}rraga, Joaqu{\'\i}n and Medina, Ignacio and Carbonell, Jos{\'e} and Pulido, Luis and De Maria, Alejandro and Capella-Gut{\'\i}errez, Salvador and Huerta-Cepas, Jaime and Gabald{\'o}n, Toni and Dopazo, Joaquin and Dopazo, Hern{\'a}n} } @article {605, title = {FatiGO +: a functional profiling tool for genomic data. Integration of functional annotation, regulatory motifs and interaction data with microarray experiments.}, journal = {Nucleic Acids Res}, volume = {35}, year = {2007}, month = {2007 Jul}, pages = {W91-6}, abstract = {

The ultimate goal of any genome-scale experiment is to provide a functional interpretation of the data, relating the available information with the hypotheses that originated the experiment. Thus, functional profiling methods have become essential in diverse scenarios such as microarray experiments, proteomics, etc. We present the FatiGO+, a web-based tool for the functional profiling of genome-scale experiments, specially oriented to the interpretation of microarray experiments. In addition to different functional annotations (gene ontology, KEGG pathways, Interpro motifs, Swissprot keywords and text-mining based bioentities related to diseases and chemical compounds) FatiGO+ includes, as a novelty, regulatory and structural information. The regulatory information used includes predictions of targets for distinct regulatory elements (obtained from the Transfac and CisRed databases). Additionally FatiGO+ uses predictions of target motifs of miRNA to infer which of these can be activated or deactivated in the sample of genes studied. Finally, properties of gene products related to their relative location and connections in the interactome have also been used. Also, enrichment of any of these functional terms can be directly analysed on chromosomal coordinates. FatiGO+ can be found at: http://www.fatigoplus.org and within the Babelomics environment http://www.babelomics.org.

}, keywords = {Amino Acid Motifs, Animals, Binding Sites, Computational Biology, Gene Expression Profiling, Genes, Genomics, Humans, Internet, Oligonucleotide Array Sequence Analysis, Programming Languages, Software, Systems Integration, Transcription Factors}, issn = {1362-4962}, doi = {10.1093/nar/gkm260}, author = {Al-Shahrour, F{\'a}tima and Minguez, Pablo and T{\'a}rraga, Joaqu{\'\i}n and Medina, Ignacio and Alloza, Eva and Montaner, David and Dopazo, Joaquin} }