bioRxiv ScienceSearch

SEARCH · bioRxiv Science

Results for “Bioinformatics”

Search indexed bioRxiv preprints in genomics, neuroscience, cell biology and bioinformatics. Read source abstracts and check manuscript versions; preprints are not peer reviewed.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 235 records · Page 13Linked to original sources

KimLabIDV: Application for Interactive RNA-Seq Data Analysis and Visualization

Many R packages have been developed for transcriptome analysis but their use often requires familiarity with R and integrating results of different packages is difficult. Here we present PIVOT, an R-based application with a uniform user interface and graphical data management that allows non-programmers to conveniently access various bioinformatics tools and interactively explore transcriptomics data. PIVOT supports many popular open source packages for transcriptome analysis and provides an extensive set of tools for statistical data manipulations. A graph-based visual interface is used to represent the links between derived datasets, allowing easy tracking of data versions. PIVOT further supports automatic report generation, publication-quality plots, and program/data state saving, such that all analysis can be saved, shared and reproduced.

Bioinformatics

EGAD: Ultra-fast functional analysis of gene networks

SummaryEvaluating gene networks with respect to known biology is a common task but often a computationally costly one. Many computational experiments are difficult to apply exhaustively in network analysis due to run-times. To permit high-throughput analysis of gene networks, we have implemented a set of very efficient tools to calculate functional properties in networks based on guilt-by-association methods. EGAD (Extending Guilt-by-Association by Degree) allows gene networks to be evaluated with respect to hundreds or thousands of gene sets. The methods predict novel members of gene groups, assess how well a gene network groups known sets of genes, and determines the degree to which generic predictions drive performance. By allowing fast evaluations, whether of random sets or real functional ones, EGAD provides the user with an assessment of performance which can easily be used in controlled evaluations across many parameters.\n\nAvailability and ImplementationThe software package is freely available at https://github.com/sarbal/EGAD and implemented for use in R and Matlab. The package is also freely available under the LGPL license from the Bioconductor web site (http://bioconductor.org).\n\nContactJGillis@cshl.edu\n\nSupplementary informationSupplementary data are available at Bioinformatics online and the full manual at http://gillislab.labsites.cshl.edu/software/egad-extending-guilt-by-association-by-degree/.

Bioinformatics

Tribe: The collaborative platform for reproducible web-based analysis of gene sets

BackgroundThe adoption of new bioinformatics webservers provides biological researchers with new analytical opportunities but also raises workflow challenges. These challenges include sharing collections of genes with collaborators, translating gene identifiers to the most appropriate nomenclature for each server, tracking these collections across multiple analysis tools and webservers, and maintaining effective records of the genes used in each analysis.\n\nDescriptionIn this paper, we present the Tribe webserver (available at https://tribe.greenelab.com), which addresses these challenges in order to make multi-server workflows seamless and reproducible. This allows users to create analysis pipelines that use their own sets of genes in combinations of specialized data mining webservers and tools while seamlessly maintaining gene set version control. Tribes web interface facilitates collaborative editing: users can share with collaborators, who can then view, download, and edit these collections. Tribes fully-featured API allows users to interact with Tribe programmatically if desired. Tribe implements the OAuth 2.0 standard as well as gene identifier mapping, which facilitates its integration into existing servers. Access to Tribes resources is facilitated by an easy-to-install Python application called tribe-client. We provide Tribe and tribe-client under a permissive open-source license to encourage others to download the source code and set up a local instance or to extend its capabilities.\n\nConclusionsThe Tribe webserver addresses challenges that have made reproducible multi-webserver workflows difficult to implement until now. It is open source, has a user-friendly web interface, and provides a means for researchers to perform reproducible gene set based analyses seamlessly across webservers and command line tools.

Bioinformatics

tHapMix: simulating tumour samples through haplotype mixtures

MotivationLarge-scale rearrangements and copy number changes combined with different modes of cloevolution create extensive somatic genome diversity, making it difficult to develop versatile and scalable oriant calling tools and create well-calibrated benchmarks.\n\nResultsWe developed a new simulation framework tHapMix that enables the creation of tumour samples with different ploidy, purity and polyclonality features. It easily scales to simulation of hundreds of somatic genomes, while re-use of real read data preserves noise and biases present in sequencing platforms. We further demonstrate tHapMix utility by creating a simulated set of 140 somatic genomes and showing how it can be used in training and testing of somatic copy number variant calling tools.\n\nAvailability and implementationtHapMix is distributed under an open source license and can be downloaded from https://github.com/Illumina/tHapMix.\n\nContactsivakhno@illumina.com\n\nSupplementary informationSupplementary data are available at Bioinformatics online.

Bioinformatics

mmgenome: a toolbox for reproducible genome extraction from metagenomes

SummaryRecovery of population genomes is becoming a standard analysis in metagenomics and a multitude of different approaches exists. However, the workflows are complex, requiring data generation, binning, validation and finishing to generate high quality population genome bins. In addition, several different approaches are often used on the same dataset as the optimal strategy to extract a specific population genome varies. Here we introduce mmgenome: a toolbox for reproducible genome extraction from metagenomes. At the core of mmgenome is an R package that facilitates effortless integration of different binning strategies by collecting information on scaffolds. Genome binning is facilitated through integrated tools that support effortless visualizations, validation and calculation of key statistics. Full reproducibility and transparency is obtained through Rmarkdown, whereby every step can be recreated.\n\nAvailability and implementationThe binning framework of mmge-nome is implemented in R. Wrapper scripts for data generation and finishing is written in Perl. The mmgenome toolbox and associated step-by-step guides are available at http://madsal-bertsen.github.io/mmgenome/.\n\nContactma@bio.aau.dk\n\nSupplementary informationSupplementary data are available at Bioinformatics online.

Bioinformatics

BlastPhyMe: A toolkit for rapid generation and analysis of protein-coding sequence datasets

AO_SCPLOWBSTRACTC_SCPLOWO_ST_ABSSO_SCPLOWUMMARYC_SCPLOWC_ST_ABSWe present BlastPhyMe (BLAST, Phylogenies, and Molecular Evolution) a new application to facilitate the fast and easy generation and analysis of protein-coding sequence datasets. The application uses a portable database framework to manage and organize sequences along with a graphical user interface (GUI) that makes the application extremely easy to use. BlastPhyMe utilizes several existing services and applications in a unique way that save researchers considerable time when building and analyzing protein-coding datasets. The application consists of two modules that can be used separately or together. The first module enables the assembly of coding sequence datasets. BLAST searches can be used to obtain all related sequences of interest from NCBI. Full GenBank records are saved within the database and coding sequences are automatically extracted. A feature of particular note is that sequences can be sorted based on NCBI taxonomic hierarchy before export for visualization using existing tools, such as fast. The application provides GUIs for automatic alignment of sequences with the popular tools MUSCLE and PRANK, as well as for reconstructing phylogenetic trees using PhyML. The second module incorporates selection analyses using codon-based likelihood methods. The alignments and phylogenetic trees generated with the dataset module, or those generated elsewhere, can be used to run the models implemented in the codeml PAML package. A GUI allows easy selection of models and parameters. Importantly, replicate analyses with different parameter starting values can be automatically performed in order to ensure selection of the best-fitting model. Multiple analyses can be run simultaneously based on the number of processor cores available, while additional analyses will be run iteratively until completed. Results are saved within the database and can be exported to publication-ready Excel tables, which further automatically compute the appropriate likelihood ratio test between models in order to determine statistical significance. Future updates will add additional options for phylogenetic reconstruction (eg, MrBayes) and selection analyses (eg, HYPHY). BlastPhyMe saves researches of all bioinformatics experience levels considerable time by automating the numerous tasks required for the generation and analysis of protein-coding sequence datasets using a straightforward graphical interface. AO_SCPLOWVAILABILITYC_SCPLOWInstallation package and source code available from: https://github.com/ryankschott/BlastPhyMe CO_SCPLOWONTACTC_SCPLOWschottr@si.edu

Bioinformatics

aRNApipe: A balanced, efficient and distributed pipeline for processing RNA-seq data in high performance computing environments

SummaryThe wide range of RNA-seq applications and their high computational needs require the development of pipelines orchestrating the entire workflow and optimizing usage of available computational resources. We present aRNApipe, a project-oriented pipeline for processing of RNA-seq data in high performance cluster environments. aRNApipe is highly modular and can be easily migrated to any high performance computing (HPC) environment. The current applications included in aRNApipe combine the essential RNA-seq primary analyses, including quality control metrics, transcript alignment, count generation, transcript fusion identification, alternative splicing, and sequence variant calling. aRNApipe is project-oriented and dynamic so users can easily update analyses to include or exclude samples or enable additional processing modules. Workflow parameters are easily set using a single configuration file that provides centralized tracking of all analytical processes. Finally, aRNApipe incorporates interactive web reports for sample tracking and a tool for managing the genome assemblies available to perform an analysis.\n\nAvailability and documentationhttps://github.com/HudsonAlpha/aRNAPipe; DOI:10.5281/zenodo.202950\n\nContactrmyers@hudsonalpha.org\n\nSupplementary informationSupplementary data are available at Bioinformatics online.

Bioinformatics

16SpeB: Towards defining bacterial species boundaries by intra-species gene sequence identity

Summary16SpeB (16S rRNA-based Species Boundary) is a package of Perl programs that evaluates total sequence variation of a bacterial species at the levels of the whole 16S rRNA sequences or single hypervariable (V) regions, using publicly-available sequences. The 16SpeB pipelines filter sequences from duplicated strains and of low quality, extracts a V region of interest using general primer sequences, and calculates sequence percentage identity (%ID) through all possible pairwise alignments.\n\nResultsThe minimum %ID of 16S rRNA gene sequences for 15 clinically-important bacterial species, as determined by 16SpeB, ranged from 82.6% to 99.8%. The relationship between minimum %ID of V2/V6 regions and full-gene sequences varied among species, indicating that %ID species limits should be resolved independently for each region of the 16S rRNA gene and bacterial species.\n\nAvailability16SpeB and user manual are freely available for download from: https://github.com/pnpnpn/16SpeB. A video tutorial is available at: https://youtu.be/Vd6YmMhyBiA\n\nContactcw442@cornell.edu\n\nSupplementary informationSupplementary data are available at Bioinformatics online.

Bioinformatics

Fast genotyping of known SNPs through approximate k-mer matching

MotivationAs the volume of next-generation sequencing (NGS) data increases, faster algorithms become necessary. Although speeding up individual components of a sequence analysis pipeline (e.g. read mapping) can reduce the computational cost of analysis, such approaches do not take full advantage of the particulars of a given problem. One problem of great interest, genotyping a known set of variants (e.g. dbSNP or Affymetrix SNPs), is important for characterization of known genetic traits and causative disease variants within an individual, as well as the initial stage of many ancestral and population genomic pipelines (e.g. GWAS).\n\nResultsWe introduce LAVA (Lightweight Assignment of Variant Alleles), an NGS-based genotyping algorithm for a given set of SNP loci, which takes advantage of the fact that approximate matching of mid-size k-mers (with k = 32) can typically uniquely identify loci in the human genome without full read alignment. LAVA accurately calls the vast majority of SNPs in dbSNP and Affymetrixs Genome-Wide Human SNP Array 6.0 up to about an order of magnitude faster than standard NGS genotyping pipelines. For Affymetrix SNPs, LAVA has significantly higher SNP calling accuracy than existing pipelines while using as low as ~5GB of RAM. As such, LAVA represents a scalable computational method for population-level genotyping studies as well as a flexible NGS-based replacement for SNP arrays.\n\nAvailabilityLAVA software is available at http://lava.csail.mit.edu.\n\nContactbab@mit.edu\n\nSupplementary informationSupplementary data are available at Bioinformatics online.

Bioinformatics

KAT: A K-mer Analysis Toolkit to quality control NGS datasets and genome assemblies

MotivationDe novo assembly of whole genome shotgun (WGS) next-generation sequencing (NGS) data bene[fi]ts from high-quality input with high coverage. However, in practice, determining the quality and quantity of useful reads quickly and in a reference-free manner is not trivial. Gaining a better understanding of the WGS data, and how that data is utilised by assemblers, provides useful insights that can inform the assembly process and result in better assemblies.\n\nResultsWe present the K-mer Analysis Toolkit (KAT): a multi-purpose software toolkit for reference-free quality control (QC) of WGS reads and de novo genome assemblies, primarily via their k-mer frequencies and GC composition. KAT enables users to assess levels of errors, bias and contamination at various stages of the assembly process. In this paper we highlight KATs ability to provide valuable insights into assembly composition and quality of genome assemblies through pairwise comparison of k-mers present in both input reads and the assemblies.\n\nAvailabilityKAT is available under the GPLv3 license at: https://github.com/TGAC/KAT.\n\nContactbernardo.clavijo@earlham.ac.uk\n\nSupplementary InformationSupplementary Information (SI) is available at Bioinformatics online. In addition, the software documentation is available online at: http://kat.readthedocs.io/en/latest/.

Bioinformatics

Phosphoproteomics-based Profiling of Kinase Activities in Cancer Cells

Cellular signaling, predominantly mediated by phosphorylation through protein kinases, is found to be deregulated in most cancers. Accordingly, protein kinases have been subject to intense investigations in cancer research, to understand their role in oncogenesis and to discover new therapeutic targets. Despite great advances, an understanding of kinase dysfunctioning in cancer is far from complete.\n\nA powerful tool to investigate phosphorylation is mass-spectrometry (MS)-based phosphoproteomics, which enables the identification of thousands of phosphorylated peptides in a single experiment. Since every phosphorylation event results from the activity of a protein kinase, high-coverage phosphoproteomics data should indirectly contain comprehensive information about the activity of protein kinases.\n\nIn this chapter, we discuss the use of computational methods to predict kinase activity scores from MS-based phosphoproteomics data. We start with a short explanation of the fundamental features of the phosphoproteomics data acquisition process from the perspective of the computational analysis. Next, we briefly review the existing databases with experimentally verified kinase-substrate relationships and present a set of bioinformatic tools to discover novel kinase targets. We then introduce different methods to infer kinase activities from phosphoproteomics data and these kinase-substrate relationships. We illustrate their application with a detailed protocol of one of the methods, KSEA (Kinase Substrate Enrichment Analysis). This method is implemented in Python within the framework of the open-source Kinase Activity Toolbox (kinact), which is freely available at http://github.com/saezlab/kinact/.

Bioinformatics

False Negatives Are a Significant Feature of Next Generation Sequencing Callsets

Short-read, next-generation sequencing (NGS) is now broadly used to identify rare or de novo mutations in population samples and disease cohorts. However, NGS data is known to be error-prone and post-processing pipelines have primarily focused on the removal of spurious mutations or \"false positives\" in downstream genome datasets. Less attention has been paid to characterizing the fraction of missing mutations or \"false negatives\" (FN). We design a phylogeny-aware tool to determine false negatives [PhyloFaN] and describe how read coverage and reference bias affect the FN rate. Using thousand-fold coverage NGS data from both Illumina HiSeq and Complete Genomics platforms derived from the 1000 Genomes Project, we first characterize the false negative rate in human mtDNA genomes. The false negative rate for the publically available callsets is 17-20%, even for extremely high coverage haploid data. We demonstrate that high FN rates are not limited to mtDNA by comparing autosomal data from 28 publically available full genomes to intergenic Sanger sequenced regions for each individual. We examine both low-coverage Illumina and high-coverage Complete Genomics genomes. We show that the FN rate varies between [~]6%-18% and that false-positive rates are considerably lower (<3%). The FN rate is strongly dependent on calling pipeline parameters, as well as read coverage. Our results demonstrate that missing mutations are a significant feature of genomic datasets and imply additional fine-tuning of bioinformatics pipelines is needed. We provide a tool which can be used to quantify the FN rate for haploid genomic experiments, without additional generation of validation data.\n\nData depositionData and software are freely available on the Henn Lab website: https://ecoevo.stonybrook.edu/hennlab/data-software/\n\nSoftwareGITHUB via https://ecoevo.stonybrook.edu/hennlab/data-software/

Bioinformatics

Structure, interaction and post-translational modification study of arsenic reduction system in Bifidobacterium longum

Microbial metabolism contributes to degradation of organoarsenicals, where arsenic reductases (glutaredoxins) play pivotal role in bacterial resistance to arsenic. Ars operon studies have revealed reduction of arsenate As(V) to arsenite As(III) by respiratory-chain-linked reductase enzyme complexes. Although structure of some bacterial arsenate reductases has been solved but not attempted for Bifidobacterium longum DJO10A colonizing the human gastrointestinal tract. Here it has been endeavoured to analyze and understand the structure, properties, interaction, evolution and action mechanism of this enzyme (arsC1) and its accessory interactors (arsB1, arsB2 and arsR). A systematic bioinformatic based analysis was carried out using a battery of tools and web servers for this purpose. Arsenic resistance gene cluster of gram-positive Bifidobacterium obtained from STRING database illustrated contiguous arsC and arsB genes and absence of arsA gene. ArsC1 was determined to be a cytoplasmic small-molecular-mass protein (~15 kDa) related to a class of tyrosine phosphatases mediating the reduction of As(V) to As(III). ArsC1 was found to be involved in dephosphorylation of arsR, arsB1 and arsB2, indicating its role in post translational modification (PTM) of interacting proteins. 3D structure analysis revealed that it was composed of 1 sheet,1 beta alpha beta unit, 4 strands, 5 helices, 3 helix-helix interacs, 13 beta turns and 1 gamma turn. All proteins in the cluster exhibited hydrophobic interactions. Explicit protein-protein hydrogen, ionic, aromatic and cation-pi interactions in arsenate reducing operon of Bifidobacterium longum DJO10A further aided structural understanding of arsenate reduction process.\n\nNoteThis research was carried out in 2015. Availability of new information or changes in the algorithm behind software/database used for text mining interaction analysis in the meantime might impact some of the analyzed values. The preprint version may contain grammatical and proofreading mistakes. Errors and omissions excepted.

Bioinformatics

ABySS 2.0: Resource-Efficient Assembly of Large Genomes using a Bloom Filter

The assembly of DNA sequences de novo is fundamental to genomics research. It is the first of many steps towards elucidating and characterizing whole genomes. Downstream applications, including analysis of genomic variation between species, between or within individuals critically depends on robustly assembled sequences. In the span of a single decade, the sequence throughput of leading DNA sequencing instruments has increased drastically, and coupled with established and planned large-scale, personalized medicine initiatives to sequence genomes in the thousands and even millions, the development of efficient, scalable and accurate bioinformatics tools for producing high-quality reference draft genomes is timely.\n\nWith ABySS 1.0, we originally showed that assembling the human genome using short 50 bp sequencing reads was possible by aggregating the half terabyte of compute memory needed over several computers using a standardized message-passing system (MPI). We present here its re-design, which departs from MPI and instead implements algorithms that employ a Bloom filter, a probabilistic data structure, to represent a de Bruijn graph and reduce memory requirements.\n\nWe present assembly benchmarks of human Genome in a Bottle 250 bp Illumina paired-end and 6 kbp mate-pair libraries from a single individual, yielding a NG50 (NGA50) scaffold contiguity of 3.5 (3.0) Mbp using less than 35 GB of RAM, a modest memory requirement by todays standard that is often available on a single computer. We also investigate the use of BioNano Genomics and 10x Genomics Chromium data to further improve the scaffold contiguity of this assembly to 42 (15) Mbp.

Bioinformatics

Quantifying uncertainty of taxonomic placement in DNA barcoding and metabarcoding

O_LIA crucial step in the use of DNA markers for biodiversity surveys is the assignment of Linnaean taxonomies (species, genus, etc.) to sequence reads. This allows the use of all the information known based on the taxonomic names. Taxonomic placement of DNA barcoding sequences is inherently probabilistic because DNA sequences contain errors, because there is natural variation among sequences within a species, and because reference databases are incomplete and can have false annotations. However, most existing bioinformatics methods for taxonomic placement either exclude uncertainty, or quantify it using metrics other than probability.\nC_LIO_LIIn this paper we evaluate the performance of a recently proposed probabilistic taxonomic placement method PROTAX by applying it to both annotated reference sequence data as well as unknown environmental data. Our four case studies include contrasting taxonomic groups (fungi, bacteria, mammals, and insects), variation in the length and quality of the barcoding sequences (from individually Sanger-sequenced sequences to short Illumina reads), variation in the structures and sizes of the taxonomies (from 800 to 130 000 species), and variation in the completeness of the reference databases (representing 15% to 100% of the species).\nC_LIO_LIOur results demonstrate that PROTAX yields essentially unbiased assessment of probabilities of taxonomic placement, and thus that its quantification of species identification uncertainty is reliable. As expected, the accuracy of taxonomic placement increases with increasing coverage of taxonomic and reference sequence databases, and with increasing ratio of genetic variation among taxonomic levels over within taxonomic levels.\nC_LIO_LIOur results show that reliable species-level identification from environmental samples is still challenging, and thus neglecting identification uncertainty can lead to spurious inference. A key aim for future research is the completion and pruning of taxonomic and reference sequence databases, and making these two types of data compatible.\nC_LI

Bioinformatics

Edlib: A C/C++ library for fast, exact sequence alignment using edit distance

We present Edlib, an open-source C/C++ library for exact pairwise sequence alignment using edit distance. We compare Edlib to other libraries and show that it is the fastest while not lacking in functionality, and can also easily handle very large sequences. Being easy to use, flexible, fast and low on memory usage, we expect it to be a cornerstone for many future bioinformatics tools.\n\nSource code, installation instructions and test data are freely available for download at https://github.com/Martinsos/edlib, implemented in C/C++ and supported on Linux, MS Windows, and Mac OS.\n\nContact: mile.sikic@fer.hr

Bioinformatics

GAVIN - Gene-Aware Variant INterpretation for medical sequencing

Here, we present GAVIN, a new method that delivers accurate classification of variants for next-generation sequencing molecular diagnostics. It is based on gene-specific calibrations of allele frequencies (from the ExAC database), effect impact (using SnpEff) and estimated deleteriousness (CADD scores) for >3,000 genes. In a benchmark on 18 clinical gene sets, we achieved a sensitivity of 91.6%, with a specificity of 78.2%. This accuracy was unmatched by 12 other tools we tested. We provide GAVIN as an online MOLGENIS service to annotate VCF files, and as open source executable for use in bioinformatic pipelines. It can be found at http://molgenis.org/gavin.

Bioinformatics

dms2dfe: Comprehensive Workflow for Analysis of Deep Mutational Scanning Data

High throughput genotype to phenotype (G2P) data is increasingly being generated by widely applicable Deep Mutational Scanning (DMS) method. dms2dfe is a comprehensive end-to-end workflow that addresses critical issue with noise reduction and offers variety of crucial downstream analyses. Noise reduction is carried out by normalizing counts of mutants by depth of sequencing and subsequent dispersion shrinkage at the level of calculation of preferential enrichments. In downstream analyses, dms2dfe workflow provides identification of relative selection pressures, potential molecular constraints and generation of data-rich visualizations.\n\nAvailabilitydms2dfe is implemented as a python package and it is available at https://kc-lab.github.io/dms2dfe.\n\nContactkausik@igib.in, rohan@igib.in\n\nSupplementary informationSupplementary data are available at Bioinformatics online.

Bioinformatics