Volume 13 Supplement 10
Selected articles from the 7th International Symposium on Bioinformatics Research and Applications (ISBRA'11)
Proceedings
Edited by Jianer Chen, Ion Mandoiu, Raj Sunderraman, Jianxin Wang and Alexander Zelikovsky
7th International Symposium on Bioinformatics Research and Applications (ISBRA'11). Go to conference site.
Changsha, China27-29 May 2011
-
Citation: BMC Bioinformatics 2012 13(Suppl 10):S1
-
Computing the protein binding sites
Identifying the location of binding sites on proteins is of fundamental importance for a wide range of applications including molecular docking, de novo drug design, structure identification and comparison of ...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S2 -
Prediction of DNA-binding propensity of proteins by the ball-histogram method using automatic template search
We contribute a novel, ball-histogram approach to DNA-binding propensity prediction of proteins. Unlike state-of-the-art methods based on constructing an ad-hoc set of features describing physicochemical properti...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S3 -
High-performance blob-based iterative three-dimensional reconstruction in electron tomography using multi-GPUs
Three-dimensional (3D) reconstruction in electron tomography (ET) has emerged as a leading technique to elucidate the molecular structures of complex biological specimens. Blob-based iterative methods are adva...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S4 -
The maximum clique enumeration problem: algorithms, applications, and implementations
The maximum clique enumeration (MCE) problem asks that we identify all maximum cliques in a finite, simple graph. MCE is closely related to two other well-known and widely-studied problems: the maximum clique ...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S5 -
Efficient error correction for next-generation sequencing of viral amplicons
Next-generation sequencing allows the analysis of an unprecedented number of viral sequence variants from infected patients, presenting a novel opportunity for understanding virus evolution, drug resistance an...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S6 -
A systematic comparison of genome-scale clustering algorithms
A wealth of clustering algorithms has been applied to gene co-expression experiments. These algorithms cover a broad range of approaches, from conventional techniques such as k-means and hierarchical clustering, ...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S7 -
Genome plasticity and systems evolution in Streptomyces
Streptomycetes are filamentous soil-dwelling bacteria. They are best known as the producers of a great variety of natural products such as antibiotics, antifungals, antiparasitics, and anticancer agents and th...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S8 -
Gene order in rosid phylogeny, inferred from pairwise syntenies among extant genomes
Ancestral gene order reconstruction for flowering plants has lagged behind developments in yeasts, insects and higher animals, because of the recency of widespread plant genome sequencing, sequencers' embargoe...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S9 -
Guided evolution of in silico microbial populations in complex environments accelerates evolutionary rates through a step-wise adaptation
During their lifetime, microbes are exposed to environmental variations, each with its distinct spatio-temporal dynamics. Microbial communities display a remarkable degree of phenotypic plasticity, and highly-...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S10 -
Efficient error correction algorithms for gene tree reconciliation based on duplication, duplication and loss, and deep coalescence
Gene tree - species tree reconciliation problems infer the patterns and processes of gene evolution within a species tree. Gene tree parsimony approaches seek the evolutionary scenario that implies the fewest ...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S11 -
Consensus properties for the deep coalescence problem and their application for scalable tree search
To infer a species phylogeny from unlinked genes, phylogenetic inference methods must confront the biological processes that create incongruence between gene trees and the species phylogeny. Intra-specific gen...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S12 -
Horizontal gene transfer dynamics and distribution of fitness effects during microbial in silico evolution
Horizontal gene transfer (HGT) is a process that facilitates the transfer of genetic material between organisms that are not directly related, and thus can affect both the rate of evolution and emergence of tr...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S13 -
Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem
Evolutionary methods are increasingly challenged by the wealth of fast growing resources of genomic sequence information. Evolutionary events, like gene duplication, loss, and deep coalescence, account more th...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S14 -
Comparative evaluation of set-level techniques in predictive classification of gene expression samples
Analysis of gene expression data in terms of a priori-defined gene sets has recently received significant attention as this approach typically yields more compact and interpretable results than those produced ...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S15 -
Exploring biological interaction networks with tailored weighted quasi-bicliques
Biological networks provide fundamental insights into the functional characterization of genes and their products, the characterization of DNA-protein interactions, the identification of regulatory mechanisms,...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S16 -
Gene network modular-based classification of microarray samples
Molecular predictor is a new tool for disease diagnosis, which uses gene expression to classify diagnostic category of a patient. The statistical challenge for constructing such a predictor is that there are t...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S17 -
A methodology for detecting the orthology signal in a PPI network at a functional complex level
Stable evolutionary signal has been observed in a yeast protein-protein interaction (PPI) network. These finding suggests more connected regions of a PPI network to be potential mediators of evolutionary infor...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S18 -
Efficient and accurate greedy search methods for mining functional modules in protein interaction networks
Most computational algorithms mainly focus on detecting highly connected subgraphs in PPI networks as protein complexes but ignore their inherent organization. Furthermore, many of these algorithms are computa...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S19 -
Predicting multiplex subcellular localization of proteins using protein-protein interaction network: a comparative study
Proteins that interact in vivo tend to reside within the same or "adjacent" subcellular compartments. This observation provides opportunities to reveal protein subcellular localization in the context of the pr...
Citation: BMC Bioinformatics 2012 13(Suppl 10):S20
Annual Journal Metrics
-
Citation Impact 2023
Journal Impact Factor: 2.9
5-year Journal Impact Factor: 3.6
Source Normalized Impact per Paper (SNIP): 0.821
SCImago Journal Rank (SJR): 1.005
Speed 2023
Submission to first editorial decision (median days): 12
Submission to acceptance (median days): 146
Usage 2023
Downloads: 5,987,678
Altmetric mentions: 4,858