VLDB 2026 Research / reviewers in the wild / expert
Alexander Rurainski
dblp:12/2449
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 3
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
2 papers |
Bioinformatics and computational biology · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 5 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › network bioinformatics › biological network analysis › network visualization
biological network visualization |
0.2 | 1 | 2013 | NetworkTrail - a web service for identifying and visualizing deregulated subnetworks · Bioinform. 2013 |
Bioinformatics and computational biology › network bioinformatics › biological network analysis
network visualization |
0.2 | 1 | 2013 | NetworkTrail - a web service for identifying and visualizing deregulated subnetworks · Bioinform. 2013 |
Bioinformatics and computational biology › systems bioinformatics
pathway analysis |
0.2 | 1 | 2013 | NetworkTrail - a web service for identifying and visualizing deregulated subnetworks · Bioinform. 2013 |
Bioinformatics and computational biology › structural bioinformatics
molecular structure analysis |
0.1 | 1 | 2011 | Automated bond order assignment as an optimization problem · Bioinform. 2011 |
Mathematical optimization
combinatorial optimization |
0.1 | 1 | 2011 | Automated bond order assignment as an optimization problem · Bioinform. 2011 |
Methods — techniques the papers use, named apart from their topics
integer linear programming · 0.4fixed-parameter tractability · 0.2a* search · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | NetworkTrail - a web service for identifying and visualizing deregulated subnetworksabstractUNLABELLED: The deregulation of biochemical pathways plays a central role in many diseases like cancer or Parkinsons's disease. In silico tools for calculating these deregulated pathways may help to gain new insights into pathogenic mechanisms and may open novel avenues for therapy stratification in the sense of personalized medicine. Here, we present NetworkTrail, a web service for the detection of deregulated pathways and subgraphs in biological networks. NetworkTrail uses a state-of-the-art integer linear programming-based approach for this task and offers interfaces to the Biological Network Analyzer (BiNA) and Cytoscape Web for visualizing the resulting subnetworks. By providing an accessible interface to otherwise hard-to-use command line tools, the new web service enables non-experts to quickly and reliably carry out this type of network analyses. AVAILABILITY AND IMPLEMENTATION: NetworkTrail is a JavaServer Pages-based web service. The algorithm for finding deregulated subnetworks has been implemented in C++. NetworkTrail is available at http://networktrail.bioinf.uni-sb.de/. Daniel Stöckel, Oliver Müller 0003, Tim Kehl, Andreas Gerasch, Christina Backes, Alexander Rurainski, Andreas Keller, Michael Kaufmann 0001, Hans-Peter Lenhof |
Bioinform. | 6 |
| 2011 | Automated bond order assignment as an optimization problemabstractMOTIVATION: Numerous applications in Computational Biology process molecular structures and hence strongly rely not only on correct atomic coordinates but also on correct bond order information. For proteins and nucleic acids, bond orders can be easily deduced but this does not hold for other types of molecules like ligands. For ligands, bond order information is not always provided in molecular databases and thus a variety of approaches tackling this problem have been developed. In this work, we extend an ansatz proposed by Wang et al. that assigns connectivity-based penalty scores and tries to heuristically approximate its optimum. In this work, we present three efficient and exact solvers for the problem replacing the heuristic approximation scheme of the original approach: an A*, an ILP and an fixed-parameter approach (FPT) approach. RESULTS: We implemented and evaluated the original implementation, our A*, ILP and FPT formulation on the MMFF94 validation suite and the KEGG Drug database. We show the benefit of computing exact solutions of the penalty minimization problem and the additional gain when computing all optimal (or even suboptimal) solutions. We close with a detailed comparison of our methods. AVAILABILITY: The A* and ILP solution are integrated into the open-source C++ LGPL library BALL and the molecular visualization and modelling tool BALLView and can be downloaded from our homepage www.ball-project.org. The FPT implementation can be downloaded from http://bio.informatik.uni-jena.de/software/. Anna Katharina Hildebrandt, Alexander Rurainski, Quang Bao Anh Bui, Sebastian Böcker, Hans-Peter Lenhof, Andreas Hildebrandt 0001 |
Bioinform. | 2 |
| 2010 | BALL - biochemical algorithms library 1.3abstractBACKGROUND: The Biochemical Algorithms Library (BALL) is a comprehensive rapid application development framework for structural bioinformatics. It provides an extensive C++ class library of data structures and algorithms for molecular modeling and structural bioinformatics. Using BALL as a programming toolbox does not only allow to greatly reduce application development times but also helps in ensuring stability and correctness by avoiding the error-prone reimplementation of complex algorithms and replacing them with calls into the library that has been well-tested by a large number of developers. In the ten years since its original publication, BALL has seen a substantial increase in functionality and numerous other improvements. RESULTS: Here, we discuss BALL's current functionality and highlight the key additions and improvements: support for additional file formats, molecular edit-functionality, new molecular mechanics force fields, novel energy minimization techniques, docking algorithms, and support for cheminformatics. CONCLUSIONS: BALL is available for all major operating systems, including Linux, Windows, and MacOS X. It is available free of charge under the Lesser GNU Public License (LPGL). Parts of the code are distributed under the GNU Public License (GPL). BALL is available as source code and binary packages from the project web site at http://www.ball-project.org. Recently, it has been accepted into the debian project; integration into further distributions is currently pursued. Andreas Hildebrandt 0001, Anna Katharina Hildebrandt, Alexander Rurainski, Andreas Bertsch, Marcel Schumann, Nora C. Toussaint, Andreas Moll, Daniel Stöckel, Stefan Nickels, Sabine C. Mueller, Hans-Peter Lenhof, Oliver Kohlbacher |
BMC Bioinform. | 3 |