BlaSTorage: a fast package to parse, manage and store BLAST results.
Ontology highlight
ABSTRACT: Unlabelled
Background
Large-scale sequence studies requiring BLAST-based analysis produce huge amounts of data to be parsed. BLAST parsers are available, but they are often missing some important features, such as keeping all information from the raw BLAST output, allowing direct access to single results, and performing logical operations over them.Findings
We implemented BlaSTorage, a Python package that parses multi BLAST results and returns them in a purpose-built object-database format. Unlike other BLAST parsers, BlaSTorage retains and stores all parts of BLAST results, including alignments, without loss of information; a complete API allows access to all the data components.Conclusions
BlaSTorage shows comparable speed of more basic parser written in compiled languages as C++ and can be easily integrated into web applications or software pipelines.
SUBMITTER: Orsini M
PROVIDER: S-EPMC3571973 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:IntroductionThe UK Biobank (UKB) is a resource that includes detailed health-related data on about 500,000 individuals and is available to the research community. However, several obstacles limit immediate analysis of the data: data files vary in format, may be very large, and have numerical codes for column names.Resultsukbtools removes all the upfront data wrangling required to get a single dataset for statistical analysis. All associated data files are merged into a single dataset with descriptive column names. The package also provides tools to assist in quality control by exploring the primary demographics of subsets of participants; query of disease diagnoses for one or more individuals, and estimating disease frequency relative to a reference variable; and to retrieve genetic metadata.ConclusionHaving a dataset with meaningful variable names, a set of UKB-specific exploratory data analysis tools, disease query functions, and a set of helper functions to explore and write genetic metadata to file, will rapidly enable UKB users to undertake their research.
| S-EPMC6544205 | biostudies-literature
Project description:Biodiversity data aggregators, such as Global Biodiversity Information Facility (GBIF) suffer from inflation of the number of occurrence records when data from different databases are merged but not fully reconciled. The ParseGBIF workflow is designed to parse duplicate GBIF species occurrence records into unique collection events (gatherings) and to optimise the quality of the spatial data associated with them. ParseGBIF provides tools to verify and standardize species scientific names according to the World Checklist of Vascular Plants taxonomic backbone, and to parse duplicate records into unique 'collection events', in the process compiling the most informative spatial data, where more than one duplicate is available, and providing crude estimates of taxonomic and spatial data quality. When GBIF occurrence records for a medium-sized vascular plant family, the Myrtaceae, were processed by ParseGBIF, the average number of records useful for spatial analysis increased by 180%. ParseGBIF could therefore be valuable in the evaluation of species' occurrences at the national scale in support for national biodiversity plans, identification of plant areas important for biodiversity, sample bias estimation to inform future sampling efforts, and to forecast species range shifts in response to global climate change.
| S-EPMC10914741 | biostudies-literature
Project description:Chronic myeloid leukemia (CML) is triggered primarily by the t(9;22) (q34.13; q11.23) translocation. This reciprocal chromosomal translocation leads to the formation of the BCR-ABL fusion gene. Patients in the chronic phase (CP) experience a good curative effect with tyrosine kinase inhibitors. However, cases are treatment refractory, with a dismal prognosis, when the disease has progressed to the accelerated phase (AP) or blast phase (BP). Until now, few reports have provided a comprehensive description of the mechanisms involved at different molecular levels. Indeed, the underlying pathogenesis of CML evolution comprises genetic aberrations, chromosomal translocations (except for the Philadelphia chromosome), telomere biology, and epigenetic anomalies. Herein, we provide knowledge of the biology responsible for blast transformation of CML at several levels, such as genetics, telomere biology, and epigenetic anomalies. Because of the limited treatment options available and poor outcomes, only the therapeutic response is monitored regularly, which involves BCR-ABL transcript level assessment and immunologic surveillance, with the optimal treatment strategy for patients in CP adapted to evaluate disease recurrence or progression. Overall, selecting optimal treatment endpoints to predict survival and successful TFR improves the quality of life of patients. Thus, identifying risk factors and developing risk-adapted therapeutic options may contribute to a better outcome for advanced-phase patients.
| S-EPMC8236273 | biostudies-literature
Project description:New High-Performance Computing architectures have been recently developed for commercial central processing unit (CPU). Yet, that has not improved the execution time of widely used bioinformatics applications, like BLAST+. This is due to a lack of optimization between the bases of the existing algorithms and the internals of the hardware that allows taking full advantage of the available CPU cores. To optimize the new architectures, algorithms must be revised and redesigned; usually rewritten from scratch. BLVector adapts the high-level concepts of BLAST+ to the x86 architectures with AVX-512, to harness their capabilities. A deep comprehensive study has been carried out to optimize the approach, with a significant reduction in time execution. BLVector reduces the execution time of BLAST+ when aligning up to mid-size protein sequences (∼750 amino acids). The gain in real scenario cases is 3.2-fold. When applied to longer proteins, BLVector consumes more time than BLAST+, but retrieves a much larger set of results. BLVector and BLAST+ are fine-tuned heuristics. Therefore, the relevant results returned by both are the same, although they behave differently specially when performing alignments with low scores. Hence, they can be considered complementary bioinformatics tools.
| S-EPMC7884812 | biostudies-literature
Project description:BackgroundBasic local alignment search tool (BLAST) searches are frequently used to look for homologous sequences and to annotate a query protein, but the increasing size of protein databases makes it difficult to review all results from a similarity search.FindingsWe developed a web tool called Cluster and Annotate Blast Results Algorithm (CABRA), which enables a rapid BLAST search in a variety of updated reference proteomes, and provides a new way to functionally evaluate the results by the subsequent clustering of the hits and annotation of the clusters. The tool can be accessed from the following web-resource: http://cbdm-01.zdv.uni-mainz.de/~munoz/CABRA .ConclusionsCluster and Annotate Blast Results Algorithm simplifies the analysis of the results of a BLAST search by providing an overview of the result's annotations organized in clusters that can be iteratively modified by the user.
| S-EPMC4851773 | biostudies-literature
Project description:A major computational challenge in the genomic era is annotating structure/function to the vast quantities of sequence information that is now available. This problem is illustrated by the fact that most proteins lack comprehensive annotations, even when experimental evidence exists. We previously theorized that embedded-alignment profiles (simply "alignment profiles" hereafter) provide a quantitative method that is capable of relating the structural and functional properties of proteins, as well as their evolutionary relationships. A key feature of alignment profiles lies in the interoperability of data format (e.g., alignment information, physio-chemical information, genomic information, etc.). Indeed, we have demonstrated that the Position Specific Scoring Matrices (PSSMs) are an informative M-dimension that is scored by quantitatively measuring the embedded or unmodified sequence alignments. Moreover, the information obtained from these alignments is informative, and remains so even in the "twilight zone" of sequence similarity (<25% identity). Although our previous embedding strategy was powerful, it suffered from contaminating alignments (embedded AND unmodified) and high computational costs. Herein, we describe the logic and algorithmic process for a heuristic embedding strategy named "Adaptive GDDA-BLAST." Adaptive GDDA-BLAST is, on average, up to 19 times faster than, but has similar sensitivity to our previous method. Further, data are provided to demonstrate the benefits of embedded-alignment measurements in terms of detecting structural homology in highly divergent protein sequences and isolating secondary structural elements of transmembrane and ankyrin-repeat domains. Together, these advances allow further exploration of the embedded alignment data space within sufficiently large data sets to eventually induce relevant statistical inferences. We show that sequence embedding could serve as one of the vehicles for measurement of low-identity alignments and for incorporation thereof into high-performance PSSM-based alignment profiles.
| S-EPMC2962639 | biostudies-literature
Project description:Previous studies have linked food consumption outside the home and fast food to poor diet quality and living within a food swamp to an increased likelihood of obesity. A growing amount of research has linked food marketing to food choice. Still, limited information is available on how this dynamic may work within fast food establishments and if the marketing strategies used may vary by neighborhood food swamp status. Utilizing the Environment Assessment (EAT) Tool, we examined the within-store marketing environment of fast food restaurants to understand the factors potentially influencing food choice. A cross-sectional study design surveyed fast food outlets (n = 170) for unhealthy advertisements. Each fast-food outlet was assigned an FSI score based on its geographic location and proximity to unhealthy outlets. Outlets were assessed for associations between food swamp status and unhealthy advertisements. Poisson Regression was performed to assess the relationship between unhealthy advertisements and FSI score. Low FSI had a mean unhealthy advertisement score of 36.79 (11.06). Moderate and High FSI had mean unhealthy advertisement scores of 33.03 (14.67) and 31.71 (12.63), respectively. The number of unhealthy advertisements did not differ by food swamp categories (Moderate FSI IRR: 0.90, 95% CI: 0.74-1.09; High FSI IRR: 0.86, 95% CI: 0.73-1.01 vs. low FSI). Differences in marketing environments by food swamp status were not observed. Future research should examine other factors of the food swamp environment and additional factors such as television or social media to understand its association with food choice.
| S-EPMC10428106 | biostudies-literature
Project description:MOTIVATION:Modern genomic research is driven by next-generation sequencing experiments such as ChIP-seq and ChIA-PET that generate coverage files for transcription factor binding, as well as DHS and ATAC-seq that yield coverage files for chromatin accessibility. Such files are in a bedGraph text format or a bigWig binary format. Obtaining summary statistics in a given region is a fundamental task in analyzing protein binding intensity or chromatin accessibility. However, the existing Python package for operating on coverage files is not optimized for speed. RESULTS:We developed pyBedGraph, a Python package to quickly obtain summary statistics for a given interval in a bedGraph or a bigWig file. When tested on 12 ChIP-seq, ATAC-seq, RNA-seq and ChIA-PET datasets, pyBedGraph is on average 260 times faster than the existing program pyBigWig. On average, pyBedGraph can look up the exact mean signal of 1 million regions in ?0.26?s and can compute their approximate means in <0.12?s on a conventional laptop. AVAILABILITY AND IMPLEMENTATION:pyBedGraph is publicly available at https://github.com/TheJacksonLaboratory/pyBedGraph under the MIT license. SUPPLEMENTARY INFORMATION:Supplementary data are available at Bioinformatics online.
| S-EPMC7214040 | biostudies-literature
Project description:BackgroundThe need to compare protein profiles frequently arises in various protein research areas: comparison of protein families, domain searches, resolution of orthology and paralogy. The existing fast algorithms can only compare a protein sequence with a protein sequence and a profile with a sequence. Algorithms to compare profiles use dynamic programming and complex scoring functions.ResultsWe developed a new algorithm called PHOG-BLAST for fast similarity search of profiles. This algorithm uses profile discretization to convert a profile to a finite alphabet and utilizes hashing for fast search. To determine the optimal alphabet, we analyzed columns in reliable multiple alignments and obtained column clusters in the 20-dimensional profile space by applying a special clustering procedure. We show that the clustering procedure works best if its parameters are chosen so that 20 profile clusters are obtained which can be interpreted as ancestral amino acid residues. With these clusters, only less than 2% of columns in multiple alignments are out of clusters. We tested the performance of PHOG-BLAST vs. PSI-BLAST on three well-known databases of multiple alignments: COG, PFAM and BALIBASE. On the COG database both algorithms showed the same performance, on PFAM and BALIBASE PHOG-BLAST was much superior to PSI-BLAST. PHOG-BLAST required 10-20 times less computer memory and computation time than PSI-BLAST.ConclusionSince PHOG-BLAST can compare multiple alignments of protein families, it can be used in different areas of comparative proteomics and protein evolution. For example, PHOG-BLAST helped to build the PHOG database of phylogenetic orthologous groups. An essential step in building this database was comparing protein complements of different species and orthologous groups of different taxons on a personal computer in reasonable time. When it is applied to detect weak similarity between protein families, PHOG-BLAST is less precise than rigorous profile-profile comparison method, though it runs much faster and can be used as a hit pre-selecting tool.
| S-EPMC1522020 | biostudies-literature
Project description:QSCOP is a quantitative structural classification of proteins which distinguishes itself from other classifications by two essential properties: (i) QSCOP is concurrent with the Research Collaboratory for Structural Bioinformatics (RCSB) Protein Data Bank and (ii) QSCOP covers the widely used SCOP classification with layers of quantitative structural information. The QSCOP-BLAST web server presented here combines the BLAST sequence search engine with QSCOP to retrieve, for a given query sequence, all structural information currently available. The resulting search engine is reliable in terms of the quality of results obtained, and it is efficient in that results are displayed instantaneously. The hierarchical organization of QSCOP is used to control the redundancy and diversity of the retrieved hits with the benefit that the often cumbersome and difficult interpretation of search results is an intuitive and straightforward exercise. We demonstrate the use of QSCOP-BLAST by example. The server is accessible at http://qscop-blast.services.came.sbg.ac.at/
| S-EPMC1933160 | biostudies-literature