Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Aleksandar Stojmirovic

dblp:15/6406 · DBLP profile ↗
← Back
9ranked-venue papers
6as first author
0since 2021 · last 2015
0000-0003-0957-6893ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 6 · 4 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorTheory of computation · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
6 papers
Bioinformatics and computational biology · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › protein analysis › protein-protein interaction
protein-protein interaction network analysis
0.322015
Topology-function conservation in protein-protein interaction networks · Bioinform. 2015
ITM Probe: analyzing information flow in protein networks · Bioinform. 2009
Bioinformatics and computational biology › functional genomics
functional enrichment analysis
0.332012
CytoSaddleSum: a functional enrichment analysis plugin for Cytoscape based on sum-of-weights scores · Bioinform. 2012
Robust and accurate data enrichment statistics via distribution function of sum of weights · Bioinform. 2010
ITM Probe: analyzing information flow in protein networks · Bioinform. 2009
Bioinformatics and computational biology › biological data visualization
sequence logo
0.212015
Log-odds sequence logos · Bioinform. 2015
Bioinformatics and computational biology › protein sequence analysis
protein similarity search
0.112008
The effectiveness of position- and composition-specific gap costs for protein similarity searches · ISMB 2008
Bioinformatics and computational biology
sequence alignment
0.112008
The effectiveness of position- and composition-specific gap costs for protein similarity searches · ISMB 2008
Bioinformatics and computational biology
multiple sequence alignment
0.112015
Log-odds sequence logos · Bioinform. 2015
Bioinformatics and computational biology › protein function prediction
network-based function prediction
0.112015
Topology-function conservation in protein-protein interaction networks · Bioinform. 2015
Bioinformatics and computational biology
protein function prediction
0.112015
Topology-function conservation in protein-protein interaction networks · Bioinform. 2015

Methods — techniques the papers use, named apart from their topics

normalized maximum likelihood · 0.2graphlet degree · 0.2canonical correlation analysis · 0.2bayesian measure · 0.2sum-of-weight scoring · 0.1lugananni-rice formula · 0.1bonferroni correction · 0.1asymptotic approximation · 0.1diffusion with damping · 0.1hidden markov model · 0.1
YearPublicationVenuePosition
2015 Topology-function conservation in protein-protein interaction networks
abstract
MOTIVATION: Proteins underlay the functioning of a cell and the wiring of proteins in protein-protein interaction network (PIN) relates to their biological functions. Proteins with similar wiring in the PIN (topology around them) have been shown to have similar functions. This property has been successfully exploited for predicting protein functions. Topological similarity is also used to guide network alignment algorithms that find similarly wired proteins between PINs of different species; these similarities are used to transfer annotation across PINs, e.g. from model organisms to human. To refine these functional predictions and annotation transfers, we need to gain insight into the variability of the topology-function relationships. For example, a function may be significantly associated with specific topologies, while another function may be weakly associated with several different topologies. Also, the topology-function relationships may differ between different species. RESULTS: To improve our understanding of topology-function relationships and of their conservation among species, we develop a statistical framework that is built upon canonical correlation analysis. Using the graphlet degrees to represent the wiring around proteins in PINs and gene ontology (GO) annotations to describe their functions, our framework: (i) characterizes statistically significant topology-function relationships in a given species, and (ii) uncovers the functions that have conserved topology in PINs of different species, which we term topologically orthologous functions. We apply our framework to PINs of yeast and human, identifying seven biological process and two cellular component GO terms to be topologically orthologous for the two organisms.
Darren Davis, Omer Nebil Yaveroglu, Noël Malod-Dognin, Aleksandar Stojmirovic, Natasa Przulj
Bioinform.4
2015 Log-odds sequence logos
abstract
MOTIVATION: DNA and protein patterns are usefully represented by sequence logos. However, the methods for logo generation in common use lack a proper statistical basis, and are non-optimal for recognizing functionally relevant alignment columns. RESULTS: We redefine the information at a logo position as a per-observation multiple alignment log-odds score. Such scores are positive or negative, depending on whether a column's observations are better explained as arising from relatedness or chance. Within this framework, we propose distinct normalized maximum likelihood and Bayesian measures of column information. We illustrate these measures on High Mobility Group B (HMGB) box proteins and a dataset of enzyme alignments. Particularly in the context of protein alignments, our measures improve the discrimination of biologically relevant positions. AVAILABILITY AND IMPLEMENTATION: Our new measures are implemented in an open-source Web-based logo generation program, which is available at http://www.ncbi.nlm.nih.gov/CBBresearch/Yu/logoddslogo/index.html. A stand-alone version of the program is also available from this site. CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Yi-Kuo Yu, John A. Capra, Aleksandar Stojmirovic, David Landsman, Stephen F. Altschul
Bioinform.3
2013 PFMFind: A System for Discovery of Peptide Homology and Function
Aleksandar Stojmirovic, Peter Andreae, Mike Boland, Thomas William Jordan, Vladimir Pestov
SISAP1
2012 CytoSaddleSum: a functional enrichment analysis plugin for Cytoscape based on sum-of-weights scores
abstract
Abstract Summary: CytoSaddleSum provides Cytoscape users with access to the functionality of SaddleSum, a functional enrichment tool based on sum-of-weight scores. It operates by querying SaddleSum locally (using the standalone version) or remotely (through an HTTP request to a web server). The functional enrichment results are shown as a term relationship network, where nodes represent terms and edges show term relationships. Furthermore, query results are written as Cytoscape attributes allowing easy saving, retrieval and integration into network-based data analysis workflows. Availability: www.ncbi.nlm.nih.gov/CBBresearch/Yu/downloads.html The source code is placed in Public Domain. Contact: [email protected] Supplementary information: Supplementary materials are available at Bioinformatics online.
Aleksandar Stojmirovic, Alexander Bliskovsky, Yi-Kuo Yu
Bioinform.1
2010 Robust and accurate data enrichment statistics via distribution function of sum of weights
abstract
MOTIVATION: Term-enrichment analysis facilitates biological interpretation by assigning to experimentally/computationally obtained data annotation associated with terms from controlled vocabularies. This process usually involves obtaining statistical significance for each vocabulary term and using the most significant terms to describe a given set of biological entities, often associated with weights. Many existing enrichment methods require selections of (arbitrary number of) the most significant entities and/or do not account for weights of entities. Others either mandate extensive simulations to obtain statistics or assume normal weight distribution. In addition, most methods have difficulty assigning correct statistical significance to terms with few entities. RESULTS: Implementing the well-known Lugananni-Rice formula, we have developed a novel approach, called SaddleSum, that is free from all the aforementioned constraints and evaluated it against several existing methods. With entity weights properly taken into account, SaddleSum is internally consistent and stable with respect to the choice of number of most significant entities selected. Making few assumptions on the input data, the proposed method is universal and can thus be applied to areas beyond analysis of microarrays. Employing asymptotic approximation, SaddleSum provides a term-size-dependent score distribution function that gives rise to accurate statistical significance even for terms with few entities. As a consequence, SaddleSum enables researchers to place confidence in its significance assignments to small terms that are often biologically most specific. AVAILABILITY: Our implementation, which uses Bonferroni correction to account for multiple hypotheses testing, is available at http://www.ncbi.nlm.nih.gov/CBBresearch/qmbp/mn/enrich/. Source code for the standalone version can be downloaded from ftp://ftp.ncbi.nlm.nih.gov/pub/qmbpmn/SaddleSum/.
Aleksandar Stojmirovic, Yi-Kuo Yu
Bioinform.1
2009 ITM Probe: analyzing information flow in protein networks
abstract
SUMMARY: Founded upon diffusion with damping, ITM Probe is an application for modeling information flow in protein interaction networks without prior restriction to the sub-network of interest. Given a context consisting of desired origins and destinations of information, ITM Probe returns the set of most relevant proteins with weights and a graphical representation of the corresponding sub-network. With a click, the user may send the resulting protein list for enrichment analysis to facilitate hypothesis formation or confirmation. AVAILABILITY: ITM Probe web service and documentation can be found at www.ncbi.nlm.nih.gov/CBBresearch/qmbp/mn/itm_probe.
Aleksandar Stojmirovic, Yi-Kuo Yu
Bioinform.1
2008 The effectiveness of position- and composition-specific gap costs for protein similarity searches
abstract
MOTIVATION: The flexibility in gap cost enjoyed by hidden Markov models (HMMs) is expected to afford them better retrieval accuracy than position-specific scoring matrices (PSSMs). We attempt to quantify the effect of more general gap parameters by separately examining the influence of position- and composition-specific gap scores, as well as by comparing the retrieval accuracy of the PSSMs constructed using an iterative procedure to that of the HMMs provided by Pfam and SUPERFAMILY, curated ensembles of multiple alignments. RESULTS: We found that position-specific gap penalties have an advantage over uniform gap costs. We did not explore optimizing distinct uniform gap costs for each query. For Pfam, PSSMs iteratively constructed from seeds based on HMM consensus sequences perform equivalently to HMMs that were adjusted to have constant gap transition probabilities, albeit with much greater variance. We observed no effect of composition-specific gap costs on retrieval performance. These results suggest possible improvements to the PSI-BLAST protein database search program. AVAILABILITY: The scripts for performing evaluations are available upon request from the authors.
Aleksandar Stojmirovic, E. Michael Gertz, Stephen F. Altschul, Yi-Kuo Yu
ISMB1
2007 Indexing schemes for similarity search in datasets of short protein fragments
Aleksandar Stojmirovic, Vladimir Pestov
Inf. Syst.1
2006 Indexing Schemes for Similarity Search: an Illustrated Paradigm
Vladimir Pestov, Aleksandar Stojmirovic
Fundam. Informaticae2