for Journals by Title or ISSN
for Articles by Keywords
  Subjects -> COMPUTER SCIENCE (Total: 2050 journals)
    - ANIMATION AND SIMULATION (30 journals)
    - AUTOMATION AND ROBOTICS (100 journals)
    - COMPUTER ARCHITECTURE (9 journals)
    - COMPUTER ENGINEERING (10 journals)
    - COMPUTER GAMES (16 journals)
    - COMPUTER PROGRAMMING (27 journals)
    - COMPUTER SCIENCE (1196 journals)
    - COMPUTER SECURITY (46 journals)
    - DATA BASE MANAGEMENT (14 journals)
    - DATA MINING (32 journals)
    - E-BUSINESS (22 journals)
    - E-LEARNING (28 journals)
    - IMAGE AND VIDEO PROCESSING (39 journals)
    - INFORMATION SYSTEMS (109 journals)
    - INTERNET (94 journals)
    - SOCIAL WEB (51 journals)
    - SOFTWARE (34 journals)
    - THEORY OF COMPUTING (8 journals)

COMPUTER SCIENCE (1196 journals)                  1 2 3 4 5 6 | Last

Showing 1 - 200 of 872 Journals sorted alphabetically
3D Printing and Additive Manufacturing     Full-text available via subscription   (Followers: 20)
Abakós     Open Access   (Followers: 4)
ACM Computing Surveys     Hybrid Journal   (Followers: 22)
ACM Journal on Computing and Cultural Heritage     Hybrid Journal   (Followers: 8)
ACM Journal on Emerging Technologies in Computing Systems     Hybrid Journal   (Followers: 11)
ACM Transactions on Accessible Computing (TACCESS)     Hybrid Journal   (Followers: 3)
ACM Transactions on Algorithms (TALG)     Hybrid Journal   (Followers: 15)
ACM Transactions on Applied Perception (TAP)     Hybrid Journal   (Followers: 5)
ACM Transactions on Architecture and Code Optimization (TACO)     Hybrid Journal   (Followers: 9)
ACM Transactions on Autonomous and Adaptive Systems (TAAS)     Hybrid Journal   (Followers: 7)
ACM Transactions on Computation Theory (TOCT)     Hybrid Journal   (Followers: 12)
ACM Transactions on Computational Logic (TOCL)     Hybrid Journal   (Followers: 3)
ACM Transactions on Computer Systems (TOCS)     Hybrid Journal   (Followers: 17)
ACM Transactions on Computer-Human Interaction     Hybrid Journal   (Followers: 14)
ACM Transactions on Computing Education (TOCE)     Hybrid Journal   (Followers: 5)
ACM Transactions on Design Automation of Electronic Systems (TODAES)     Hybrid Journal   (Followers: 3)
ACM Transactions on Economics and Computation     Hybrid Journal  
ACM Transactions on Embedded Computing Systems (TECS)     Hybrid Journal   (Followers: 3)
ACM Transactions on Information Systems (TOIS)     Hybrid Journal   (Followers: 19)
ACM Transactions on Intelligent Systems and Technology (TIST)     Hybrid Journal   (Followers: 7)
ACM Transactions on Interactive Intelligent Systems (TiiS)     Hybrid Journal   (Followers: 3)
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)     Hybrid Journal   (Followers: 9)
ACM Transactions on Reconfigurable Technology and Systems (TRETS)     Hybrid Journal   (Followers: 6)
ACM Transactions on Sensor Networks (TOSN)     Hybrid Journal   (Followers: 7)
ACM Transactions on Speech and Language Processing (TSLP)     Hybrid Journal   (Followers: 8)
ACM Transactions on Storage     Hybrid Journal  
ACS Applied Materials & Interfaces     Full-text available via subscription   (Followers: 27)
Acta Automatica Sinica     Full-text available via subscription   (Followers: 2)
Acta Universitatis Cibiniensis. Technical Series     Open Access  
Ad Hoc Networks     Hybrid Journal   (Followers: 11)
Adaptive Behavior     Hybrid Journal   (Followers: 11)
Advanced Engineering Materials     Hybrid Journal   (Followers: 28)
Advanced Science Letters     Full-text available via subscription   (Followers: 9)
Advances in Adaptive Data Analysis     Hybrid Journal   (Followers: 7)
Advances in Artificial Intelligence     Open Access   (Followers: 15)
Advances in Calculus of Variations     Hybrid Journal   (Followers: 2)
Advances in Catalysis     Full-text available via subscription   (Followers: 5)
Advances in Computational Mathematics     Hybrid Journal   (Followers: 18)
Advances in Computer Science : an International Journal     Open Access   (Followers: 15)
Advances in Computing     Open Access   (Followers: 2)
Advances in Data Analysis and Classification     Hybrid Journal   (Followers: 51)
Advances in Engineering Software     Hybrid Journal   (Followers: 27)
Advances in Geosciences (ADGEO)     Open Access   (Followers: 13)
Advances in Human Factors/Ergonomics     Full-text available via subscription   (Followers: 23)
Advances in Human-Computer Interaction     Open Access   (Followers: 19)
Advances in Materials Sciences     Open Access   (Followers: 14)
Advances in Operations Research     Open Access   (Followers: 12)
Advances in Parallel Computing     Full-text available via subscription   (Followers: 6)
Advances in Porous Media     Full-text available via subscription   (Followers: 5)
Advances in Remote Sensing     Open Access   (Followers: 43)
Advances in Science and Research (ASR)     Open Access   (Followers: 4)
Advances in Technology Innovation     Open Access   (Followers: 5)
AEU - International Journal of Electronics and Communications     Hybrid Journal   (Followers: 8)
African Journal of Information and Communication     Open Access   (Followers: 6)
African Journal of Mathematics and Computer Science Research     Open Access   (Followers: 4)
AI EDAM     Hybrid Journal  
Air, Soil & Water Research     Open Access   (Followers: 11)
AIS Transactions on Human-Computer Interaction     Open Access   (Followers: 5)
Algebras and Representation Theory     Hybrid Journal   (Followers: 1)
Algorithms     Open Access   (Followers: 11)
American Journal of Computational and Applied Mathematics     Open Access   (Followers: 5)
American Journal of Computational Mathematics     Open Access   (Followers: 4)
American Journal of Information Systems     Open Access   (Followers: 5)
American Journal of Sensor Technology     Open Access   (Followers: 4)
Anais da Academia Brasileira de Ciências     Open Access   (Followers: 2)
Analog Integrated Circuits and Signal Processing     Hybrid Journal   (Followers: 7)
Analysis in Theory and Applications     Hybrid Journal   (Followers: 1)
Animation Practice, Process & Production     Hybrid Journal   (Followers: 5)
Annals of Combinatorics     Hybrid Journal   (Followers: 3)
Annals of Data Science     Hybrid Journal   (Followers: 11)
Annals of Mathematics and Artificial Intelligence     Hybrid Journal   (Followers: 12)
Annals of Pure and Applied Logic     Open Access   (Followers: 2)
Annals of Software Engineering     Hybrid Journal   (Followers: 13)
Annual Reviews in Control     Hybrid Journal   (Followers: 6)
Anuario Americanista Europeo     Open Access  
Applicable Algebra in Engineering, Communication and Computing     Hybrid Journal   (Followers: 2)
Applied and Computational Harmonic Analysis     Full-text available via subscription   (Followers: 1)
Applied Artificial Intelligence: An International Journal     Hybrid Journal   (Followers: 13)
Applied Categorical Structures     Hybrid Journal   (Followers: 2)
Applied Clinical Informatics     Hybrid Journal   (Followers: 2)
Applied Computational Intelligence and Soft Computing     Open Access   (Followers: 11)
Applied Computer Systems     Open Access   (Followers: 2)
Applied Informatics     Open Access  
Applied Mathematics and Computation     Hybrid Journal   (Followers: 33)
Applied Medical Informatics     Open Access   (Followers: 10)
Applied Numerical Mathematics     Hybrid Journal   (Followers: 5)
Applied Soft Computing     Hybrid Journal   (Followers: 16)
Applied Spatial Analysis and Policy     Hybrid Journal   (Followers: 4)
Applied System Innovation     Open Access  
Architectural Theory Review     Hybrid Journal   (Followers: 3)
Archive of Applied Mechanics     Hybrid Journal   (Followers: 5)
Archive of Numerical Software     Open Access  
Archives and Museum Informatics     Hybrid Journal   (Followers: 130)
Archives of Computational Methods in Engineering     Hybrid Journal   (Followers: 5)
arq: Architectural Research Quarterly     Hybrid Journal   (Followers: 7)
Artifact     Hybrid Journal   (Followers: 2)
Artificial Life     Hybrid Journal   (Followers: 7)
Asia Pacific Journal on Computational Engineering     Open Access  
Asia-Pacific Journal of Information Technology and Multimedia     Open Access   (Followers: 1)
Asian Journal of Computer Science and Information Technology     Open Access  
Asian Journal of Control     Hybrid Journal  
Assembly Automation     Hybrid Journal   (Followers: 2)
at - Automatisierungstechnik     Hybrid Journal   (Followers: 1)
Australian Educational Computing     Open Access   (Followers: 1)
Automatic Control and Computer Sciences     Hybrid Journal   (Followers: 4)
Automatic Documentation and Mathematical Linguistics     Hybrid Journal   (Followers: 5)
Automatica     Hybrid Journal   (Followers: 11)
Automation in Construction     Hybrid Journal   (Followers: 6)
Autonomous Mental Development, IEEE Transactions on     Hybrid Journal   (Followers: 9)
Basin Research     Hybrid Journal   (Followers: 5)
Behaviour & Information Technology     Hybrid Journal   (Followers: 53)
Big Data and Cognitive Computing     Open Access   (Followers: 2)
Biodiversity Information Science and Standards     Open Access  
Bioinformatics     Hybrid Journal   (Followers: 281)
Biomedical Engineering     Hybrid Journal   (Followers: 15)
Biomedical Engineering and Computational Biology     Open Access   (Followers: 13)
Biomedical Engineering, IEEE Reviews in     Full-text available via subscription   (Followers: 19)
Biomedical Engineering, IEEE Transactions on     Hybrid Journal   (Followers: 35)
Briefings in Bioinformatics     Hybrid Journal   (Followers: 43)
British Journal of Educational Technology     Hybrid Journal   (Followers: 142)
Broadcasting, IEEE Transactions on     Hybrid Journal   (Followers: 10)
c't Magazin fuer Computertechnik     Full-text available via subscription   (Followers: 1)
CALCOLO     Hybrid Journal  
Calphad     Hybrid Journal  
Canadian Journal of Electrical and Computer Engineering     Full-text available via subscription   (Followers: 14)
Capturing Intelligence     Full-text available via subscription  
Catalysis in Industry     Hybrid Journal   (Followers: 1)
CEAS Space Journal     Hybrid Journal   (Followers: 2)
Cell Communication and Signaling     Open Access   (Followers: 2)
Central European Journal of Computer Science     Hybrid Journal   (Followers: 5)
CERN IdeaSquare Journal of Experimental Innovation     Open Access   (Followers: 2)
Chaos, Solitons & Fractals     Hybrid Journal   (Followers: 3)
Chemometrics and Intelligent Laboratory Systems     Hybrid Journal   (Followers: 14)
ChemSusChem     Hybrid Journal   (Followers: 7)
China Communications     Full-text available via subscription   (Followers: 7)
Chinese Journal of Catalysis     Full-text available via subscription   (Followers: 2)
CIN Computers Informatics Nursing     Full-text available via subscription   (Followers: 11)
Circuits and Systems     Open Access   (Followers: 15)
Clean Air Journal     Full-text available via subscription   (Followers: 1)
CLEI Electronic Journal     Open Access  
Clin-Alert     Hybrid Journal   (Followers: 1)
Cluster Computing     Hybrid Journal   (Followers: 1)
Cognitive Computation     Hybrid Journal   (Followers: 4)
COMBINATORICA     Hybrid Journal  
Combinatorics, Probability and Computing     Hybrid Journal   (Followers: 4)
Combustion Theory and Modelling     Hybrid Journal   (Followers: 14)
Communication Methods and Measures     Hybrid Journal   (Followers: 12)
Communication Theory     Hybrid Journal   (Followers: 20)
Communications Engineer     Hybrid Journal   (Followers: 1)
Communications in Algebra     Hybrid Journal   (Followers: 3)
Communications in Computational Physics     Full-text available via subscription   (Followers: 2)
Communications in Partial Differential Equations     Hybrid Journal   (Followers: 3)
Communications of the ACM     Full-text available via subscription   (Followers: 52)
Communications of the Association for Information Systems     Open Access   (Followers: 16)
COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering     Hybrid Journal   (Followers: 3)
Complex & Intelligent Systems     Open Access   (Followers: 1)
Complex Adaptive Systems Modeling     Open Access  
Complex Analysis and Operator Theory     Hybrid Journal   (Followers: 2)
Complexity     Hybrid Journal   (Followers: 6)
Complexus     Full-text available via subscription  
Composite Materials Series     Full-text available via subscription   (Followers: 8)
Computación y Sistemas     Open Access  
Computation     Open Access  
Computational and Applied Mathematics     Hybrid Journal   (Followers: 2)
Computational and Mathematical Methods in Medicine     Open Access   (Followers: 2)
Computational and Mathematical Organization Theory     Hybrid Journal   (Followers: 2)
Computational and Structural Biotechnology Journal     Open Access   (Followers: 2)
Computational and Theoretical Chemistry     Hybrid Journal   (Followers: 9)
Computational Astrophysics and Cosmology     Open Access   (Followers: 1)
Computational Biology and Chemistry     Hybrid Journal   (Followers: 11)
Computational Chemistry     Open Access   (Followers: 2)
Computational Cognitive Science     Open Access   (Followers: 2)
Computational Complexity     Hybrid Journal   (Followers: 4)
Computational Condensed Matter     Open Access  
Computational Ecology and Software     Open Access   (Followers: 9)
Computational Economics     Hybrid Journal   (Followers: 9)
Computational Geosciences     Hybrid Journal   (Followers: 15)
Computational Linguistics     Open Access   (Followers: 23)
Computational Management Science     Hybrid Journal  
Computational Mathematics and Modeling     Hybrid Journal   (Followers: 8)
Computational Mechanics     Hybrid Journal   (Followers: 5)
Computational Methods and Function Theory     Hybrid Journal  
Computational Molecular Bioscience     Open Access   (Followers: 2)
Computational Optimization and Applications     Hybrid Journal   (Followers: 7)
Computational Particle Mechanics     Hybrid Journal   (Followers: 1)
Computational Research     Open Access   (Followers: 1)
Computational Science and Discovery     Full-text available via subscription   (Followers: 2)
Computational Science and Techniques     Open Access  
Computational Statistics     Hybrid Journal   (Followers: 14)
Computational Statistics & Data Analysis     Hybrid Journal   (Followers: 30)
Computer     Full-text available via subscription   (Followers: 94)
Computer Aided Surgery     Hybrid Journal   (Followers: 6)
Computer Applications in Engineering Education     Hybrid Journal   (Followers: 8)
Computer Communications     Hybrid Journal   (Followers: 10)
Computer Engineering and Applications Journal     Open Access   (Followers: 5)
Computer Journal     Hybrid Journal   (Followers: 9)
Computer Methods in Applied Mechanics and Engineering     Hybrid Journal   (Followers: 23)
Computer Methods in Biomechanics and Biomedical Engineering     Hybrid Journal   (Followers: 12)
Computer Methods in the Geosciences     Full-text available via subscription   (Followers: 2)
Computer Music Journal     Hybrid Journal   (Followers: 19)

        1 2 3 4 5 6 | Last

Journal Cover Bioinformatics
  [SJR: 4.643]   [H-I: 271]   [281 followers]  Follow
   Hybrid Journal Hybrid journal (It can contain Open Access articles)
   ISSN (Print) 1367-4803 - ISSN (Online) 1460-2059
   Published by Oxford University Press Homepage  [372 journals]
  • SimulaTE: simulating complex landscapes of transposable elements of
    • Authors: Kofler R.
      Pages: 1439 - 1439
      Abstract: Bioinformatics (2017)
      DOI :
      PubDate: Tue, 09 Jan 2018 00:00:00 GMT
      Issue No: Vol. 34, No. 8 (2018)
  • Modeling positional effects of regulatory sequences with spline
           transformations increases prediction accuracy of deep neural networks
    • Authors: Avsec Ž; Barekatain M, Cheng J, et al.
      Pages: 1261 - 1269
      Abstract: MotivationRegulatory sequences are not solely defined by their nucleic acid sequence but also by their relative distances to genomic landmarks such as transcription start site, exon boundaries or polyadenylation site. Deep learning has become the approach of choice for modeling regulatory sequences because of its strength to learn complex sequence features. However, modeling relative distances to genomic landmarks in deep neural networks has not been addressed.ResultsHere we developed spline transformation, a neural network module based on splines to flexibly and robustly model distances. Modeling distances to various genomic landmarks with spline transformations significantly increased state-of-the-art prediction accuracy of in vivo RNA-binding protein binding sites for 120 out of 123 proteins. We also developed a deep neural network for human splice branchpoint based on spline transformations that outperformed the current best, already distance-based, machine learning model. Compared to piecewise linear transformation, as obtained by composition of rectified linear units, spline transformation yields higher prediction accuracy as well as faster and more robust training. As spline transformation can be applied to further quantities beyond distances, such as methylation or conservation, we foresee it as a versatile component in the genomics deep learning toolbox.Availability and implementationSpline transformation is implemented as a Keras layer in the CONCISE python package: Analysis code is available at or gagneur@in.tum.deSupplementary informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Thu, 16 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx727
      Issue No: Vol. 34, No. 8 (2017)
  • MOCASSIN-prot: a multi-objective clustering approach for protein
           similarity networks
    • Authors: Keel B; Deng B, Moriyama E.
      Pages: 1270 - 1277
      Abstract: MotivationProteins often include multiple conserved domains. Various evolutionary events including duplication and loss of domains, domain shuffling, as well as sequence divergence contribute to generating complexities in protein structures, and consequently, in their functions. The evolutionary history of proteins is hence best modeled through networks that incorporate information both from the sequence divergence and the domain content. Here, a game-theoretic approach proposed for protein network construction is adapted into the framework of multi-objective optimization, and extended to incorporate clustering refinement procedure.ResultsThe new method, MOCASSIN-prot, was applied to cluster multi-domain proteins from ten genomes. The performance of MOCASSIN-prot was compared against two protein clustering methods, Markov clustering (TRIBE-MCL) and spectral clustering (SCPS). We showed that compared to these two methods, MOCASSIN-prot, which uses both domain composition and quantitative sequence similarity information, generates fewer false positives. It achieves more functionally coherent protein clusters and better differentiates protein families.Availability and implementationMOCASSIN-prot, implemented in Perl and Matlab, is freely available at informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Fri, 24 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx755
      Issue No: Vol. 34, No. 8 (2017)
  • Identifying functionally informative evolutionary sequence profiles
    • Authors: Gil N; Fiser A.
      Pages: 1278 - 1286
      Abstract: MotivationMultiple sequence alignments (MSAs) can provide essential input to many bioinformatics applications, including protein structure prediction and functional annotation. However, the optimal selection of sequences to obtain biologically informative MSAs for such purposes is poorly explored, and has traditionally been performed manually.ResultsWe present Selection of Alignment by Maximal Mutual Information (SAMMI), an automated, sequence-based approach to objectively select an optimal MSA from a large set of alternatives sampled from a general sequence database search. The hypothesis of this approach is that the mutual information among MSA columns will be maximal for those MSAs that contain the most diverse set possible of the most structurally and functionally homogeneous protein sequences. SAMMI was tested to select MSAs for functional site residue prediction by analysis of conservation patterns on a set of 435 proteins obtained from protein–ligand (peptides, nucleic acids and small substrates) and protein–protein interaction databases.Availability and implementation: A freely accessible program, including source code, implementing SAMMI is available at informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Fri, 01 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx779
      Issue No: Vol. 34, No. 8 (2017)
  • FROGS: Find, Rapidly, OTUs with Galaxy Solution
    • Authors: Escudié F; Auer L, Bernard M, et al.
      Pages: 1287 - 1294
      Abstract: MotivationMetagenomics leads to major advances in microbial ecology and biologists need user friendly tools to analyze their data on their own.ResultsThis Galaxy-supported pipeline, called FROGS, is designed to analyze large sets of amplicon sequences and produce abundance tables of Operational Taxonomic Units (OTUs) and their taxonomic affiliation. The clustering uses Swarm. The chimera removal uses VSEARCH, combined with original cross-sample validation. The taxonomic affiliation returns an innovative multi-affiliation output to highlight databases conflicts and uncertainties. Statistical results and numerous graphical illustrations are produced along the way to monitor the pipeline. FROGS was tested for the detection and quantification of OTUs on real and in silico datasets and proved to be rapid, robust and highly sensitive. It compares favorably with the widespread mothur, UPARSE and QIIME.Availability and implementationSource code and instructions for installation: A companion website: informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Thu, 07 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx791
      Issue No: Vol. 34, No. 8 (2017)
  • DeepSF: deep convolutional neural network for mapping protein sequences to
    • Authors: Hou J; Adhikari B, Cheng J.
      Pages: 1295 - 1303
      Abstract: MotivationProtein fold recognition is an important problem in structural bioinformatics. Almost all traditional fold recognition methods use sequence (homology) comparison to indirectly predict the fold of a target protein based on the fold of a template protein with known structure, which cannot explain the relationship between sequence and fold. Only a few methods had been developed to classify protein sequences into a small number of folds due to methodological limitations, which are not generally useful in practice.ResultsWe develop a deep 1D-convolution neural network (DeepSF) to directly classify any protein sequence into one of 1195 known folds, which is useful for both fold recognition and the study of sequence–structure relationship. Different from traditional sequence alignment (comparison) based methods, our method automatically extracts fold-related features from a protein sequence of any length and maps it to the fold space. We train and test our method on the datasets curated from SCOP1.75, yielding an average classification accuracy of 75.3%. On the independent testing dataset curated from SCOP2.06, the classification accuracy is 73.0%. We compare our method with a top profile–profile alignment method—HHSearch on hard template-based and template-free modeling targets of CASP9-12 in terms of fold recognition accuracy. The accuracy of our method is 12.63–26.32% higher than HHSearch on template-free modeling targets and 3.39–17.09% higher on hard template-based modeling targets for top 1, 5 and 10 predicted folds. The hidden features extracted from sequence by our method is robust against sequence mutation, insertion, deletion and truncation, and can be used for other protein pattern recognition problems such as protein clustering, comparison and ranking.Availability and implementationThe DeepSF server is publicly available at: informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Fri, 08 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx780
      Issue No: Vol. 34, No. 8 (2017)
  • New algorithms to represent complex pseudoknotted RNA structures in
           dot-bracket notation
    • Authors: Antczak M; Popenda M, Zok T, et al.
      Pages: 1304 - 1312
      Abstract: MotivationUnderstanding the formation, architecture and roles of pseudoknots in RNA structures are one of the most difficult challenges in RNA computational biology and structural bioinformatics. Methods predicting pseudoknots typically perform this with poor accuracy, often despite experimental data incorporation. Existing bioinformatic approaches differ in terms of pseudoknots’ recognition and revealing their nature. A few ways of pseudoknot classification exist, most common ones refer to a genus or order. Following the latter one, we propose new algorithms that identify pseudoknots in RNA structure provided in BPSEQ format, determine their order and encode in dot-bracket-letter notation. The proposed encoding aims to illustrate the hierarchy of RNA folding.ResultsNew algorithms are based on dynamic programming and hybrid (combining exhaustive search and random walk) approaches. They evolved from elementary algorithm implemented within the workflow of RNA FRABASE 1.0, our database of RNA structure fragments. They use different scoring functions to rank dissimilar dot-bracket representations of RNA structure. Computational experiments show an advantage of new methods over the others, especially for large RNA structures.Availability and implementationPresented algorithms have been implemented as new functionality of RNApdbee webserver and are ready to use at informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Mon, 11 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx783
      Issue No: Vol. 34, No. 8 (2017)
  • ASElux: an ultra-fast and accurate allelic reads counter
    • Authors: Miao Z; Alvarez M, Pajukanta P, et al.
      Pages: 1313 - 1320
      Abstract: MotivationMapping bias causes preferential alignment to the reference allele, forming a major obstacle in allele-specific expression (ASE) analysis. The existing methods, such as simulation and SNP-aware alignment, are either inaccurate or relatively slow. To fast and accurately count allelic reads for ASE analysis, we developed a novel approach, ASElux, which utilizes the personal SNP information and counts allelic reads directly from unmapped RNA-sequence (RNA-seq) data. ASElux significantly reduces runtime by disregarding reads outside single nucleotide polymorphisms (SNPs) during the alignment.ResultsWhen compared to other tools on simulated and experimental data, ASElux achieves a higher accuracy on ASE estimation than non-SNP-aware aligners and requires a much shorter time than the benchmark SNP-aware aligner, GSNAP with just a slight loss in performance. ASElux can process 40 million read-pairs from an RNA-sequence (RNA-seq) sample and count allelic reads within 10 min, which is comparable to directly counting the allelic reads from alignments based on other tools. Furthermore, processing an RNA-seq sample using ASElux in conjunction with a general aligner, such as STAR, is more accurate and still ∼4× faster than STAR + WASP, and ∼33× faster than the lead SNP-aware aligner, GSNAP, making ASElux ideal for ASE analysis of large-scale transcriptomic studies. We applied ASElux to 273 lung RNA-seq samples from GTEx and identified a splice-QTL rs11078928 in lung which explains the mechanism underlying an asthma GWAS SNP rs11078927. Thus, our analysis demonstrated ASE as a highly powerful complementary tool to cis-expression quantitative trait locus (eQTL) analysis.Availability and implementationThe software can be downloaded from or a5ko@ucla.eduSupplementary informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Thu, 23 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx762
      Issue No: Vol. 34, No. 8 (2017)
  • Meta-analytic principal component analysis in integrative omics
    • Authors: Kim S; Kang D, Huo Z, et al.
      Pages: 1321 - 1328
      Abstract: MotivationWith the prevalent usage of microarray and massively parallel sequencing, numerous high-throughput omics datasets have become available in the public domain. Integrating abundant information among omics datasets is critical to elucidate biological mechanisms. Due to the high-dimensional nature of the data, methods such as principal component analysis (PCA) have been widely applied, aiming at effective dimension reduction and exploratory visualization.ResultsIn this article, we combine multiple omics datasets of identical or similar biological hypothesis and introduce two variations of meta-analytic framework of PCA, namely MetaPCA. Regularization is further incorporated to facilitate sparse feature selection in MetaPCA. We apply MetaPCA and sparse MetaPCA to simulations, three transcriptomic meta-analysis studies in yeast cell cycle, prostate cancer, mouse metabolism and a TCGA pan-cancer methylation study. The result shows improved accuracy, robustness and exploratory visualization of the proposed framework.Availability and implementationAn R package MetaPCA is available online. ( informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Thu, 23 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx765
      Issue No: Vol. 34, No. 8 (2017)
  • Classifying next-generation sequencing data using a zero-inflated Poisson
    • Authors: Zhou Y; Wan X, Zhang B, et al.
      Pages: 1329 - 1335
      Abstract: MotivationWith the development of high-throughput techniques, RNA-sequencing (RNA-seq) is becoming increasingly popular as an alternative for gene expression analysis, such as RNAs profiling and classification. Identifying which type of diseases a new patient belongs to with RNA-seq data has been recognized as a vital problem in medical research. As RNA-seq data are discrete, statistical methods developed for classifying microarray data cannot be readily applied for RNA-seq data classification. Witten proposed a Poisson linear discriminant analysis (PLDA) to classify the RNA-seq data in 2011. Note, however, that the count datasets are frequently characterized by excess zeros in real RNA-seq or microRNA sequence data (i.e. when the sequence depth is not enough or small RNAs with the length of 18–30 nucleotides). Therefore, it is desired to develop a new model to analyze RNA-seq data with an excess of zeros.ResultsIn this paper, we propose a Zero-Inflated Poisson Logistic Discriminant Analysis (ZIPLDA) for RNA-seq data with an excess of zeros. The new method assumes that the data are from a mixture of two distributions: one is a point mass at zero, and the other follows a Poisson distribution. We then consider a logistic relation between the probability of observing zeros and the mean of the genes and the sequencing depth in the model. Simulation studies show that the proposed method performs better than, or at least as well as, the existing methods in a wide range of settings. Two real datasets including a breast cancer RNA-seq dataset and a microRNA-seq dataset are also analyzed, and they coincide with the simulation results that our proposed method outperforms the existing competitors.Availability and implementationThe software is available at∼ or informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Mon, 27 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx768
      Issue No: Vol. 34, No. 8 (2017)
  • Sequential feature selection and inference using multi-variate random
    • Authors: Mayer J; Rahman R, Ghosh S, et al.
      Pages: 1336 - 1344
      Abstract: MotivationRandom forest (RF) has become a widely popular prediction generating mechanism. Its strength lies in its flexibility, interpretability and ability to handle large number of features, typically larger than the sample size. However, this methodology is of limited use if one wishes to identify statistically significant features. Several ranking schemes are available that provide information on the relative importance of the features, but there is a paucity of general inferential mechanism, particularly in a multi-variate set up. We use the conditional inference tree framework to generate a RF where features are deleted sequentially based on explicit hypothesis testing. The resulting sequential algorithm offers an inferentially justifiable, but model-free, variable selection procedure. Significant features are then used to generate predictive RF. An added advantage of our methodology is that both variable selection and prediction are based on conditional inference framework and hence are coherent.ResultsWe illustrate the performance of our Sequential Multi-Response Feature Selection approach through simulation studies and finally apply this methodology on Genomics of Drug Sensitivity for Cancer dataset to identify genetic characteristics that significantly impact drug sensitivities. Significant set of predictors obtained from our method are further validated from biological perspective.Availability and implementation informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Mon, 18 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx784
      Issue No: Vol. 34, No. 8 (2017)
  • SANA NetGO: a combinatorial approach to using Gene Ontology (GO) terms to
           score network alignments
    • Authors: Hayes W; Mamano N.
      Pages: 1345 - 1352
      Abstract: MotivationGene Ontology (GO) terms are frequently used to score alignments between protein–protein interaction (PPI) networks. Methods exist to measure GO similarity between proteins in isolation, but proteins in a network alignment are not isolated: each pairing is dependent on every other via the alignment itself. Existing measures fail to take into account the frequency of GO terms across networks, instead imposing arbitrary rules on when to allow GO terms.ResultsHere we develop NetGO, a new measure that naturally weighs infrequent, informative GO terms more heavily than frequent, less informative GO terms, without arbitrary cutoffs, instead downweighting GO terms according to their frequency in the networks being aligned. This is a global measure applicable only to alignments, independent of pairwise GO measures, in the same sense that the edge-based EC or S3 scores are global measures of topological similarity independent of pairwise topological similarities. We demonstrate the superiority of NetGO in alignments of predetermined quality and show that NetGO correlates with alignment quality better than any existing GO-based alignment measures. We also demonstrate that NetGO provides a measure of taxonomic similarity between species, consistent with existing taxonomic measuresa feature not shared with existing GObased network alignment measures. Finally, we re-score alignments produced by almost a dozen aligners from a previous study and show that NetGO does a better job at separating good alignments from bad ones.Availability and implementationAvailable as part of SANA.Contactwhayes@uci.eduSupplementary informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Thu, 07 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx716
      Issue No: Vol. 34, No. 8 (2017)
  • Global proteomics profiling improves drug sensitivity prediction: results
           from a multi-omics, pan-cancer modeling approach
    • Authors: Ali M; Khan S, Wennerberg K, et al.
      Pages: 1353 - 1362
      Abstract: MotivationProteomics profiling is increasingly being used for molecular stratification of cancer patients and cell-line panels. However, systematic assessment of the predictive power of large-scale proteomic technologies across various drug classes and cancer types is currently lacking. To that end, we carried out the first pan-cancer, multi-omics comparative analysis of the relative performance of two proteomic technologies, targeted reverse phase protein array (RPPA) and global mass spectrometry (MS), in terms of their accuracy for predicting the sensitivity of cancer cells to both cytotoxic chemotherapeutics and molecularly targeted anticancer compounds.ResultsOur results in two cell-line panels demonstrate how MS profiling improves drug response predictions beyond that of the RPPA or the other omics profiles when used alone. However, frequent missing MS data values complicate its use in predictive modeling and required additional filtering, such as focusing on completely measured or known oncoproteins, to obtain maximal predictive performance. Rather strikingly, the two proteomics profiles provided complementary predictive signal both for the cytotoxic and targeted compounds. Further, information about the cellular-abundance of primary target proteins was found critical for predicting the response of targeted compounds, although the non-target features also contributed significantly to the predictive power. The clinical relevance of the selected protein markers was confirmed in cancer patient data. These results provide novel insights into the relative performance and optimal use of the widely applied proteomic technologies, MS and RPPA, which should prove useful in translational applications, such as defining the best combination of omics technologies and marker panels for understanding and predicting drug sensitivities in cancer patients.Availability and implementationProcessed datasets, R as well as Matlab implementations of the methods are available at or tero.aittokallio@fimm.fiSupplementary informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Mon, 27 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx766
      Issue No: Vol. 34, No. 8 (2017)
  • Model-based design of bistable cell factories for metabolic engineering
    • Authors: Srinivasan S; Cluett W, Mahadevan R.
      Pages: 1363 - 1371
      Abstract: MotivationMetabolism can exhibit dynamic phenomena like bistability due to the presence of regulatory motifs like the positive feedback loop. As cell factories, microorganisms with bistable metabolism can have a high and a low product flux at the two stable steady states, respectively. The exclusion of metabolic regulation and network dynamics limits the ability of pseudo-steady state stoichiometric models to detect the presence of bistability, and reliably assess the outcomes of design perturbations to metabolic networks.ResultsUsing kinetic models of metabolism, we assess the change in the bistable characteristics of the network, and suggest designs based on perturbations to the positive feedback loop to enable the network to produce at its theoretical maximum rate. We show that the most optimal production design in parameter space, for a small bistable metabolic network, may exist at the boundary of the bistable region separating it from the monostable region of low product fluxes. The results of our analysis can be broadly applied to other bistable metabolic networks with similar positive feedback network topologies. This can complement existing model-based design strategies by providing a smaller number of feasible designs that need to be tested in vivo.Availability and implementation informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Wed, 06 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx769
      Issue No: Vol. 34, No. 8 (2017)
  • Efficiently counting all orbits of graphlets of any order in a graph using
           autogenerated equations
    • Authors: Melckenbeeck I; Audenaert P, Colle D, et al.
      Pages: 1372 - 1380
      Abstract: MotivationGraphlets are a useful tool to determine a graph’s small-scale structure. Finding them is exponentially hard with respect to the number of nodes in each graphlet. Therefore, equations can be used to reduce the size of graphlets that need to be enumerated to calculate the number of each graphlet touching each node. Hočevar and Demšar first introduced such equations, which were derived manually, and an algorithm that uses them, but only graphlets with four or five nodes can be counted this way.ResultsWe present a new algorithm for orbit counting, which is applicable to graphlets of any order. This algorithm uses a tree structure to simplify finding orbits, and stabilizers and symmetry-breaking constraints to ensure correctness. This method gives a significant speedup compared to a brute force counting method and can count orbits beyond the capacity of other available tools.Availability and implementationAn implementation of the algorithm can be found at
      PubDate: Fri, 24 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx758
      Issue No: Vol. 34, No. 8 (2017)
  • An attention-based BiLSTM-CRF approach to document-level chemical named
           entity recognition
    • Authors: Luo L; Yang Z, Yang P, et al.
      Pages: 1381 - 1388
      Abstract: MotivationIn biomedical research, chemical is an important class of entities, and chemical named entity recognition (NER) is an important task in the field of biomedical information extraction. However, most popular chemical NER methods are based on traditional machine learning and their performances are heavily dependent on the feature engineering. Moreover, these methods are sentence-level ones which have the tagging inconsistency problem.ResultsIn this paper, we propose a neural network approach, i.e. attention-based bidirectional Long Short-Term Memory with a conditional random field layer (Att-BiLSTM-CRF), to document-level chemical NER. The approach leverages document-level global information obtained by attention mechanism to enforce tagging consistency across multiple instances of the same token in a document. It achieves better performances with little feature engineering than other state-of-the-art methods on the BioCreative IV chemical compound and drug name recognition (CHEMDNER) corpus and the BioCreative V chemical-disease relation (CDR) task corpus (the F-scores of 91.14 and 92.57%, respectively).Availability and implementationData and code are available at or wangleibihami@gmail.comSupplementary informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Fri, 24 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx761
      Issue No: Vol. 34, No. 8 (2017)
  • LitPathExplorer: a confidence-based visual text analytics tool for
           exploring literature-enriched pathway models
    • Authors: Soto A; Zerva C, Batista-Navarro R, et al.
      Pages: 1389 - 1397
      Abstract: MotivationPathway models are valuable resources that help us understand the various mechanisms underpinning complex biological processes. Their curation is typically carried out through manual inspection of published scientific literature to find information relevant to a model, which is a laborious and knowledge-intensive task. Furthermore, models curated manually cannot be easily updated and maintained with new evidence extracted from the literature without automated support.ResultsWe have developed LitPathExplorer, a visual text analytics tool that integrates advanced text mining, semi-supervised learning and interactive visualization, to facilitate the exploration and analysis of pathway models using statements (i.e. events) extracted automatically from the literature and organized according to levels of confidence. LitPathExplorer supports pathway modellers and curators alike by: (i) extracting events from the literature that corroborate existing models with evidence; (ii) discovering new events which can update models; and (iii) providing a confidence value for each event that is automatically computed based on linguistic features and article metadata. Our evaluation of event extraction showed a precision of 89% and a recall of 71%. Evaluation of our confidence measure, when used for ranking sampled events, showed an average precision ranging between 61 and 73%, which can be improved to 95% when the user is involved in the semi-supervised learning process. Qualitative evaluation using pair analytics based on the feedback of three domain experts confirmed the utility of our tool within the context of pathway model exploration.Availability and implementationLitPathExplorer is available at informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Fri, 08 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx774
      Issue No: Vol. 34, No. 8 (2017)
  • glactools: a command-line toolset for the management of genotype
           likelihoods and allele counts
    • Authors: Renaud G.
      Pages: 1398 - 1400
      Abstract: MotivationResearch projects involving population genomics routinely need to store genotyping information, population allele counts, combine files from different samples, query the data and export it to various formats. This is often done using bespoke in-house scripts, which cannot be easily adapted to new projects and seldom constitute reproducible workflows.ResultsWe introduce glactools, a set of command-line utilities that can import data from genotypes or population-wide allele counts into an intermediate representation, compute various operations on it and export the data to several file formats used by population genetics software. This intermediate format can take two forms, one to store per-individual genotype likelihoods and a second for allele counts from one or more individuals. glactools allows users to perform operations such as intersecting datasets, merging individuals into populations, creating subsets, perform queries (e.g. return sites where a given population does not share an allele with a second one) and compute summary statistics to answer biologically relevant questions.Availability and implementationglactools is freely available for use under the GPL. It requires a C ++ compiler and the htslib library. The source code and the instructions about how to download test data are available on the website ( informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Mon, 27 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx749
      Issue No: Vol. 34, No. 8 (2017)
  • SAPP: functional genome annotation and analysis through a semantic
           framework using FAIR principles
    • Authors: Koehorst J; van Dam J, Saccenti E, et al.
      Pages: 1401 - 1403
      Abstract: SummaryTo unlock the full potential of genome data and to enhance data interoperability and reusability of genome annotations we have developed SAPP, a Semantic Annotation Platform with Provenance. SAPP is designed as an infrastructure supporting FAIR de novo computational genomics but can also be used to process and analyze existing genome annotations. SAPP automatically predicts, tracks and stores structural and functional annotations and associated dataset- and element-wise provenance in a Linked Data format, thereby enabling information mining and retrieval with Semantic Web technologies. This greatly reduces the administrative burden of handling multiple analysis tools and versions thereof and facilitates multi-level large scale comparative analysis.Availability and implementationSAPP is written in JAVA and freely available at and runs on Unix-like operating systems. The documentation, examples and a tutorial are available at or
      PubDate: Thu, 23 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx767
      Issue No: Vol. 34, No. 8 (2017)
  • ASAR: visual analysis of metagenomes in R
    • Authors: Orakov A; Sakenova N, Sorokin A, et al.
      Pages: 1404 - 1405
      Abstract: MotivationFunctional and taxonomic analyses are critical steps in understanding interspecific interactions within microbial communities. Currently, such analyses are run separately, which complicates interpretation of results. Here we present the ASAR interactive tool for simultaneous analysis of metagenomic data in three dimensions: taxonomy, function, metagenome.ResultsAn interactive data analysis tool for selection, aggregation and visualization of metagenomic data is presented. Functional analysis with a SEED hierarchy and pathway diagram based on KEGG orthology based upon MG-RAST annotation results is available.Availability and implementationSource code of the ASAR is accessible at GitHub ( or
      PubDate: Fri, 01 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx775
      Issue No: Vol. 34, No. 8 (2017)
  • Gene Graphics: a genomic neighborhood data visualization web application
    • Authors: Harrison K; Crécy-Lagard V, Zallot R.
      Pages: 1406 - 1408
      Abstract: SummaryThe examination of gene neighborhood is an integral part of comparative genomics but no tools to produce publication quality graphics of gene clusters are available. Gene Graphics is a straightforward web application for creating such visuals. Supported inputs include National Center for Biotechnology Information gene and protein identifiers with automatic fetching of neighboring information, GenBank files and data extracted from the SEED database. Gene representations can be customized for many parameters including gene and genome names, colors and sizes. Gene attributes can be copied and pasted for rapid and user-friendly customization of homologous genes between species. In addition to Portable Network Graphics and Scalable Vector Graphics, produced representations can be exported as Tagged Image File Format or Encapsulated PostScript, formats that are standard for publication. Hands-on tutorials with real life examples inspired from publications are available for training.Availability and implementationGene Graphics is freely available at and source code is hosted at or remizallot@ufl.eduSupplementary informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Thu, 07 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx793
      Issue No: Vol. 34, No. 8 (2017)
  • Delta: a new web-based 3D genome visualization and analysis platform
    • Authors: Tang B; Li F, Li J, et al.
      Pages: 1409 - 1410
      Abstract: SummaryDelta is an integrative visualization and analysis platform to facilitate visually annotating and exploring the 3D physical architecture of genomes. Delta takes Hi-C or ChIA-PET contact matrix as input and predicts the topologically associating domains and chromatin loops in the genome. It then generates a physical 3D model which represents the plausible consensus 3D structure of the genome. Delta features a highly interactive visualization tool which enhances the integration of genome topology/physical structure with extensive genome annotation by juxtaposing the 3D model with diverse genomic assay outputs. Finally, by visually comparing the 3D model of the β-globin gene locus and its annotation, we speculated a plausible transitory interaction pattern in the locus. Experimental evidence was found to support this speculation by literature survey. This served as an example of intuitive hypothesis testing with the help of Delta.Availability and implementationDelta is freely accessible from, and the source code is available at informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Fri, 15 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx805
      Issue No: Vol. 34, No. 8 (2017)
  • Nephele: a cloud platform for simplified, standardized and reproducible
           microbiome data analysis
    • Authors: Weber N; Liou D, Dommer J, et al.
      Pages: 1411 - 1413
      Abstract: MotivationWidespread interest in the study of the microbiome has resulted in data proliferation and the development of powerful computational tools. However, many scientific researchers lack the time, training, or infrastructure to work with large datasets or to install and use command line tools.ResultsThe National Institute of Allergy and Infectious Diseases (NIAID) has created Nephele, a cloud-based microbiome data analysis platform with standardized pipelines and a simple web interface for transforming raw data into biological insights. Nephele integrates common microbiome analysis tools as well as valuable reference datasets like the healthy human subjects cohort of the Human Microbiome Project (HMP). Nephele is built on the Amazon Web Services cloud, which provides centralized and automated storage and compute capacity, thereby reducing the burden on researchers and their institutions.Availability and implementation and
      PubDate: Tue, 03 Oct 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx617
      Issue No: Vol. 34, No. 8 (2017)
  • Bicycle: a bioinformatics pipeline to analyze bisulfite sequencing data
    • Authors: Graña O; López-Fernández H, Fdez-Riverola F, et al.
      Pages: 1414 - 1415
      Abstract: SummaryHigh-throughput sequencing of bisulfite-converted DNA is a technique used to measure DNA methylation levels. Although a considerable number of computational pipelines have been developed to analyze such data, none of them tackles all the peculiarities of the analysis together, revealing limitations that can force the user to manually perform additional steps needed for a complete processing of the data. This article presents bicycle, an integrated, flexible analysis pipeline for bisulfite sequencing data. Bicycle analyzes whole genome bisulfite sequencing data, targeted bisulfite sequencing data and hydroxymethylation data. To show how bicycle overtakes other available pipelines, we compared them on a defined number of features that are summarized in a table. We also tested bicycle with both simulated and real datasets, to show its level of performance, and compared it to different state-of-the-art methylation analysis pipelines.Availability and implementationBicycle is publicly available under GNU LGPL v3.0 license at Users can also download a customized Ubuntu LiveCD including bicycle and other bisulfite sequencing data pipelines compared here. In addition, a docker image with bicycle and its dependencies, which allows a straightforward use of bicycle in any platform (e.g. Linux, OS X or Windows), is also or dgpena@uvigo.esSupplementary informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Fri, 01 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx778
      Issue No: Vol. 34, No. 8 (2017)
  • DaMiRseq—an R/Bioconductor package for data mining of RNA-Seq data:
           normalization, feature selection and classification
    • Authors: Chiesa M; Colombo G, Piacentini L.
      Pages: 1416 - 1418
      Abstract: SummaryRNA-Seq is becoming the technique of choice for high-throughput transcriptome profiling, which, besides class comparison for differential expression, promises to be an effective and powerful tool for biomarker discovery. However, a systematic analysis of high-dimensional genomic data is a demanding task for such a purpose. DaMiRseq offers an organized, flexible and convenient framework to remove noise and bias, select the most informative features and perform accurate classification.Availability and implementationDaMiRseq is developed for the R environment (R ≥ 3.4) and is released under GPL (≥2) License. The package runs on Windows, Linux and Macintosh operating systems and is freely available to non-commercial users at the Bioconductor open-source, open-development software project repository ( In compliance with Bioconductor standards, the authors ensure stable package maintenance through software and documentation updates.Contactluca.piacentini@ccfm.itSupplementary informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Mon, 11 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx795
      Issue No: Vol. 34, No. 8 (2017)
  • SimulaTE: simulating complex landscapes of transposable elements of
    • Authors: Kofler R.
      Pages: 1419 - 1420
      Abstract: MotivationEstimating the abundance of transposable elements (TEs) in populations (or tissues) promises to answer many open research questions. However, progress is hampered by the lack of concordance between different approaches for TE identification and thus potentially unreliable results.ResultsTo address this problem, we developed SimulaTE a tool that generates TE landscapes for populations using a newly developed domain specific language (DSL). The simple syntax of our DSL allows for easily building even complex TE landscapes that have, for example, nested, truncated and highly diverged TE insertions. Reads may be simulated for the populations using different sequencing technologies (PacBio, Illumina paired-ends) and strategies (sequencing individuals and pooled populations). The comparison between the expected (i.e. simulated) and the observed results will guide researchers in finding the most suitable approach for a particular research question.Availability and implementationSimulaTE is implemented in Python and available at Manual; Test data and tutorials; Validation
      PubDate: Mon, 27 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx772
      Issue No: Vol. 34, No. 8 (2017)
  • GenSSI 2.0: multi-experiment structural identifiability analysis of SBML
    • Authors: Ligon T; Fröhlich F, Chiş O, et al.
      Pages: 1421 - 1423
      Abstract: MotivationMathematical modeling using ordinary differential equations is used in systems biology to improve the understanding of dynamic biological processes. The parameters of ordinary differential equation models are usually estimated from experimental data. To analyze a priori the uniqueness of the solution of the estimation problem, structural identifiability analysis methods have been developed.ResultsWe introduce GenSSI 2.0, an advancement of the software toolbox GenSSI (Generating Series for testing Structural Identifiability). GenSSI 2.0 is the first toolbox for structural identifiability analysis to implement Systems Biology Markup Language import, state/parameter transformations and multi-experiment structural identifiability analysis. In addition, GenSSI 2.0 supports a range of MATLAB versions and is computationally more efficient than its previous version, enabling the analysis of more complex models.Availability and implementationGenSSI 2.0 is an open-source MATLAB toolbox and available at or jan.hasenauer@helmholtz-muenchen.deSupplementary informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Thu, 30 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx735
      Issue No: Vol. 34, No. 8 (2017)
  • Reproducible and flexible simulation experiments with ML-Rules and SESSL
    • Authors: Warnke T; Helms T, Uhrmacher A.
      Pages: 1424 - 1427
      Abstract: SummaryThe modeling language ML-Rules allows specifying and simulating complex systems biology models at multiple levels of organization. The development of such simulation models involves a wide variety of simulation experiments and the replicability of generated simulation results requires suitable means for documenting simulation experiments. Embedded domain-specific languages, such as SESSL, cater to both requirements. With SESSL, the user can integrate diverse simulation experimentation methods and third-party software components into an executable, readable simulation experiment specification. A newly developed SESSL binding for ML-Rules exploits these features of SESSL, opening up new possibilities for executing and documenting simulation experiments with ML-Rules models.Availability and implementationML-Rules is implemented in Java, SESSL and its bindings are implemented in Scala. The source code is available under open-source licenses:ML-Rules      Quickstart (Graphical Editor)      and sessl.orgSESSL Quickstart (Experiment Template), Maven-compatible compiled packages of ML-Rules, SESSL, and the SESSL bindings are available from the Maven Central Repository at (org.sessl:* and org.jamesii: mlrules).Contacttom.warnke@uni-rostock.deSupplementary informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Thu, 23 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx741
      Issue No: Vol. 34, No. 8 (2017)
  • CytoCtrlAnalyser: a Cytoscape app for biomolecular network controllability
    • Authors: Wu L; Li M, Wang J, et al.
      Pages: 1428 - 1430
      Abstract: SummaryStudying the controllability of biomolecular networks can result in profound knowledge about molecular biological systems. However, there is no comprehensive and easy-to-use platform for analyzing controllability of biomolecular networks although various algorithms for analyzing complex network controllability have been proposed recently. In this application note, we develop the CytoCtrlAnalyser which is a Cytoscape app to provide a comprehensive platform for analyzing controllability of biomolecular networks. Nine algorithms have been integrated in CytoCtrlAnalyser. With network topologies and customized control settings imported into CytoCtrlAnalyser, users can identify the steering nodes which should be actuated by input control signals for achieving different control objectives as well as investigate the importance of nodes from different perspectives in the controllability of networks. CytoCtrlAnalyser offers a tool for many promising applications, such as identification of potential drug targets or biologically important nodes in biomolecular networks.Availability and implementationFreely available for downloading at informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Thu, 23 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx764
      Issue No: Vol. 34, No. 8 (2017)
  • Rcupcake: an R package for querying and analyzing biomedical data through
           the BD2K PIC-SURE RESTful API
    • Authors: Gutiérrez-Sacristán A; Guedj R, Korodi G, et al.
      Pages: 1431 - 1432
      Abstract: MotivationIn the era of big data and precision medicine, the number of databases containing clinical, environmental, self-reported and biochemical variables is increasing exponentially. Enabling the experts to focus on their research questions rather than on computational data management, access and analysis is one of the most significant challenges nowadays.ResultsWe present Rcupcake, an R package that contains a variety of functions for leveraging different databases through the BD2K PIC-SURE RESTful API and facilitating its query, analysis and interpretation. The package offers a variety of analysis and visualization tools, including the study of the phenotype co-occurrence and prevalence, according to multiple layers of data, such as phenome, exposome or genome.Availability and implementationThe package is implemented in R and is available under Mozilla v2 license from GitHub ( Two reproducible case studies are also available (, informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Mon, 18 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx788
      Issue No: Vol. 34, No. 8 (2017)
  • FUn: a framework for interactive visualizations of large, high-dimensional
           datasets on the web
    • Authors: Probst D; Reymond J.
      Pages: 1433 - 1435
      Abstract: MotivationDuring the past decade, big data have become a major tool in scientific endeavors. Although statistical methods and algorithms are well-suited for analyzing and summarizing enormous amounts of data, the results do not allow for a visual inspection of the entire data. Current scientific software, including R packages and Python libraries such as ggplot2, matplotlib and, do not support interactive visualizations of datasets exceeding 100 000 data points on the web. Other solutions enable the web-based visualization of big data only through data reduction or statistical representations. However, recent hardware developments, especially advancements in graphical processing units, allow for the rendering of millions of data points on a wide range of consumer hardware such as laptops, tablets and mobile phones. Similar to the challenges and opportunities brought to virtually every scientific field by big data, both the visualization of and interaction with copious amounts of data are both demanding and hold great promise.ResultsHere we present FUn, a framework consisting of a client (Faerun) and server (Underdark) module, facilitating the creation of web-based, interactive 3D visualizations of large datasets, enabling record level visual inspection. We also introduce a reference implementation providing access to SureChEMBL, a database containing patent information on more than 17 million chemical compounds.Availability and implementationThe source code and the most recent builds of Faerun and Underdark, Lore.js and the data preprocessing toolchain used in the reference implementation, are available on the project website ( or
      PubDate: Fri, 24 Nov 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx760
      Issue No: Vol. 34, No. 8 (2017)
  • Curatr: a web application for creating, curating and sharing a mass
           spectral library
    • Authors: Palmer A; Phapale P, Fay D, et al.
      Pages: 1436 - 1438
      Abstract: SummaryWe have developed a web application curatr for the rapid generation of high quality mass spectral fragmentation libraries from liquid-chromatography mass spectrometry datasets. Curatr handles datasets from single or multiplexed standards and extracts chromatographic profiles and potential fragmentation spectra for multiple adducts. An intuitive interface helps users to select high quality spectra that are stored along with searchable molecular information, the providence of each standard and experimental metadata. Curatr supports exports to several standard formats for use with third party software or submission to repositories. We demonstrate the use of curatr to generate the EMBL Metabolomics Core Facility spectral library and implementationSource code and example data are at informationSupplementary dataSupplementary data are available at Bioinformatics online.
      PubDate: Thu, 14 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx786
      Issue No: Vol. 34, No. 8 (2017)
  • A novel approach based on KATZ measure to predict associations of human
           microbiota with non-infectious diseases
    • Authors: Chen X; Huang Y, You Z, et al.
      Pages: 1440 - 1440
      Abstract: Bioinformatics (2017) 33 (5): 733–739.
      PubDate: Thu, 14 Dec 2017 00:00:00 GMT
      DOI: 10.1093/bioinformatics/btx773
      Issue No: Vol. 34, No. 8 (2017)
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
Home (Search)
Subjects A-Z
Publishers A-Z
Your IP address:
About JournalTOCs
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-