Alex Zelikovsky

Prof. Dr. Alex Zelikovsky

Department of Computer Science, Georgia State University, Atlanta, GA 30303, USA
orcid

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 February 2020 in Genome Biology
Verified
Journal Article
Open access
PDF file
DLDavid Lähnemann
David Lähnemann
JKJohannes Köster
Johannes Köster
ESEwa Szczurek
Ewa Szczurek
DMDavis J McCarthy
Davis J McCarthy
SHStephanie C Hicks
Stephanie C Hicks
ASAlexander Schönhuth
Alexander Schönhuth
The recent boom in microfluidics and combinatorial indexing strategies, combined with low sequencing costs, has empowered single-cell sequencing technology. Thousands—or even millions—of cells analyzed in a single experiment amount to a data revolution in single-cell biology and pose unique data science problems. Here, we outline eleven challenges that will be central to bringing this emerging field of single-cell data science forward. For each challenge, we highlight motivating research questions, review prior work, and formulate open problems. This compendium is for established researchers, newcomers, and students alike, highlighting interesting and rewarding problems for the coming years.

1 January 2005 in SIAM Journal on Discrete Mathematics
Verified
Journal Article
Closed access
GRGabriel Robins
Gabriel Robins
Alex ZelikovskyAlex Zelikovsky
Alex Zelikovsky
The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomial-time heuristic that achieves a best-known approximation ratio of $1 + \frac{\ln 3}{2} \approx 1.55$ for general graphs and best-known approximation ratios of $\approx 1.28$ for both quasi-bipartite graphs (i.e., where no two nonterminals are adjacent) and complete graphs with edge weights 1 and 2. Our method is considerably simpler and easier to implement than previous approaches. We also prove the first known nontrivial performance bound ($1.5 \cdot$ OPT) for the iterated 1-Steiner heuristic of Kahng and Robins in quasi-bipartite graphs.

1 May 1993 in Algorithmica
Verified
Journal Article
Closed access
PDF file
Alex ZelikovskyAlex Zelikovsky
Alex Zelikovsky

1 March 1997 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
MKMarek Karpinski
Marek Karpinski
Alex ZelikovskyAlex Zelikovsky
Alex Zelikovsky

19 April 2011 in Algorithms for Molecular Biology
Verified
Journal Article
Open access
PDF file
MNMarius Nicolae
Marius Nicolae
SMSerghei Mangul
Serghei Mangul
Ion MandoiuIon Mandoiu
Ion Mandoiu
Alex ZelikovskyAlex Zelikovsky
Alex Zelikovsky
Massively parallel whole transcriptome sequencing, commonly referred as RNA-Seq, is quickly becoming the technology of choice for gene expression profiling. However, due to the short read length delivered by current sequencing technologies, estimation of expression levels for alternative splicing gene isoforms remains challenging.

27 March 2019 in Nature Communications
Verified
Journal Article
Open access
PDF file
SMSerghei Mangul
Serghei Mangul
LMLana S. Martin
Lana S. Martin
BHBrian Hill
Brian Hill
ALAngela Ka-Mei Lam
Angela Ka-Mei Lam
MDMargaret G. Distler
Margaret G. Distler
JFJonathan Flint
Jonathan Flint
Computational omics methods packaged as software have become essential to modern biological research. The increasing dependence of scientists on these powerful software tools creates a need for systematic assessment of these methods, known as benchmarking. Adopting a standardized benchmarking practice could help researchers who use omics data to better leverage recent technological innovations. Our review summarizes benchmarking practices from 25 recent studies and discusses the challenges, advantages, and limitations of benchmarking across various domains of biology. We also propose principles that can make computational biology benchmarking studies more sustainable and reproducible, ultimately increasing the transparency of biomedical data and results.