Alexander Zelikovsky mostly deals with Steiner tree problem, Approximation algorithm, Combinatorics, Discrete mathematics and Algorithm. His research in Steiner tree problem focuses on subjects like Graph, which are connected to Theory of computation and Kruskal's algorithm. The concepts of his Approximation algorithm study are interwoven with issues in Time complexity and Heuristics.
His work in the fields of Discrete mathematics, such as Minimum spanning tree, intersects with other areas such as k-minimum spanning tree. His k-minimum spanning tree research is multidisciplinary, incorporating perspectives in Vantage-point tree and Metric tree. The study incorporates disciplines such as Pursuer and Mathematical optimization in addition to Algorithm.
Alexander Zelikovsky spends much of his time researching Computational biology, Algorithm, Combinatorics, Steiner tree problem and Genetics. His Computational biology research incorporates elements of RNA-Seq, Genome, DNA microarray, DNA sequencing and Haplotype. His Discrete mathematics research extends to the thematically linked field of Combinatorics.
His Minimum spanning tree study in the realm of Discrete mathematics connects with subjects such as k-minimum spanning tree. Alexander Zelikovsky combines subjects such as Approximation algorithm and Graph with his study of Steiner tree problem. His Approximation algorithm research is multidisciplinary, incorporating elements of Time complexity, Routing and Heuristics.
His main research concerns Computational biology, Antibody, DNA sequencing, Data science and Inference. His Computational biology study combines topics from a wide range of disciplines, such as Hepatitis C virus, RNA, Outbreak, Single cell sequencing and Haplotype. His Antibody research incorporates themes from Lyme disease, Virology and Acquired immune system.
His Data science study which covers Grand Challenges that intersects with Tumour heterogeneity and Data integration. His research in Inference intersects with topics in Selection, Cluster analysis, Contextual image classification, Phylogenetics and Fitness landscape. His work in Artificial intelligence covers topics such as Genome which are related to areas like Algorithm.
His primary areas of study are Data science, Computational biology, Grand Challenges, Benchmarking and Genome. His Data science study integrates concerns from other disciplines, such as Maximum likelihood and Field. His studies in Computational biology integrate themes in fields like Acquired immune system, Viral quasispecies, Hepatitis C virus, Outbreak and Deep sequencing.
His Viral quasispecies research also works with subjects such as
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Improved Steiner tree approximation in graphs
Gabriel Robins;Alexander Zelikovsky.
symposium on discrete algorithms (2000)
Improved Steiner tree approximation in graphs
Gabriel Robins;Alexander Zelikovsky.
symposium on discrete algorithms (2000)
An 11/6-approximation algorithm for the network steiner problem
Alexander Zelikovsky.
Algorithmica (1993)
An 11/6-approximation algorithm for the network steiner problem
Alexander Zelikovsky.
Algorithmica (1993)
Eleven grand challenges in single-cell data science
David Lähnemann;David Lähnemann;Johannes Köster;Johannes Köster;Ewa Szczurek;Davis J. McCarthy;Davis J. McCarthy.
Genome Biology (2020)
Eleven grand challenges in single-cell data science
David Lähnemann;David Lähnemann;Johannes Köster;Johannes Köster;Ewa Szczurek;Davis J. McCarthy;Davis J. McCarthy.
Genome Biology (2020)
Estimation of alternative splicing isoform frequencies from RNA-Seq data
Marius Nicolae;Serghei Mangul;Ion I Măndoiu;Alex Zelikovsky.
Algorithms for Molecular Biology (2011)
Estimation of alternative splicing isoform frequencies from RNA-Seq data
Marius Nicolae;Serghei Mangul;Ion I Măndoiu;Alex Zelikovsky.
Algorithms for Molecular Biology (2011)
Filling algorithms and analyses for layout density control
A. B. Kahng;G. Robins;A. Singh;A. Zelikovsky.
international symposium on physical design (1999)
Filling algorithms and analyses for layout density control
A. B. Kahng;G. Robins;A. Singh;A. Zelikovsky.
international symposium on physical design (1999)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of California, San Diego
University of Virginia
University of California, Los Angeles
Pennsylvania State University
University of Bonn
University of California, Los Angeles
Georgia State University
European Bioinformatics Institute
Georgia State University
Georgia State University
University of Minnesota
University of Catania
University of Padua
University of Arizona
Zhejiang University
Soochow University
Seoul National University
Rensselaer Polytechnic Institute
The University of Texas at Arlington
University of Guelph
University of Sydney
Cornell University
Royal Veterinary College
University of Michigan–Ann Arbor
New York University
National Institute for Astrophysics