Demo Data from EDBT 2026 / reviewers in the wild / expert
Ludek Matyska
dblp:65/6662
· DBLP profile ↗
17ranked-venue papers
3as first author
0since 2021 · last 2020
0000-0001-6399-5453ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 7Applied, interdisciplinary, general and emerging computing · 4 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2Software engineering, systems software and programming languages · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1Theory of computation · 1 · 1 first-author
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
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › structural bioinformatics
ligand transport analysis |
0.4 | 1 | 2019 | CaverDock: a molecular docking-based tool to analyse ligand transport through protein tunnels and channels · Bioinform. 2019 |
Bioinformatics and computational biology › molecular informatics › molecular modeling
molecular docking |
0.4 | 1 | 2019 | CaverDock: a molecular docking-based tool to analyse ligand transport through protein tunnels and channels · Bioinform. 2019 |
Bioinformatics and computational biology
structural bioinformatics |
0.4 | 1 | 2019 | CaverDock: a molecular docking-based tool to analyse ligand transport through protein tunnels and channels · Bioinform. 2019 |
Methods — techniques the papers use, named apart from their topics
parallel heuristic algorithm · 0.4autodock vina · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | CaverDock: A Novel Method for the Fast Analysis of Ligand TransportabstractHere we present a novel method for the analysis of transport processes in proteins and its implementation called CaverDock. Our method is based on a modified molecular docking algorithm. It iteratively places the ligand along the access tunnel in such a way that the ligand movement is contiguous and the energy is minimized. The result of CaverDock calculation is a ligand trajectory and an energy profile of transport process. CaverDock uses the modified docking program Autodock Vina for molecular docking and implements a parallel heuristic algorithm for searching the space of possible trajectories. Our method lies in between the geometrical approaches and molecular dynamics simulations. Contrary to the geometrical methods, it provides an evaluation of chemical forces. However, it is far less computationally demanding and easier to set up compared to molecular dynamics simulations. CaverDock will find a broad use in the fields of computational enzymology, drug design, and protein engineering. The software is available free of charge to the academic users at https://loschmidt.chemi.muni.cz/caverdock/. Jiri Filipovic, Ondrej Vavra, Jan Plhak, David Bednar, Sérgio M. Marques, Jan Brezovsky, Ludek Matyska, Jirí Damborský |
IEEE ACM Trans. Comput. Biol. Bioinform. | 7 |
| 2019 | CaverDock: a molecular docking-based tool to analyse ligand transport through protein tunnels and channelsabstractMOTIVATION: Protein tunnels and channels are key transport pathways that allow ligands to pass between proteins' external and internal environments. These functionally important structural features warrant detailed attention. It is difficult to study the ligand binding and unbinding processes experimentally, while molecular dynamics simulations can be time-consuming and computationally demanding. RESULTS: CaverDock is a new software tool for analysing the ligand passage through the biomolecules. The method uses the optimized docking algorithm of AutoDock Vina for ligand placement docking and implements a parallel heuristic algorithm to search the space of possible trajectories. The duration of the simulations takes from minutes to a few hours. Here we describe the implementation of the method and demonstrate CaverDock's usability by: (i) comparison of the results with other available tools, (ii) determination of the robustness with large ensembles of ligands and (iii) the analysis and comparison of the ligand trajectories in engineered tunnels. Thorough testing confirms that CaverDock is applicable for the fast analysis of ligand binding and unbinding in fundamental enzymology and protein engineering. AVAILABILITY AND IMPLEMENTATION: User guide and binaries for Ubuntu are freely available for non-commercial use at https://loschmidt.chemi.muni.cz/caverdock/. The web implementation is available at https://loschmidt.chemi.muni.cz/caverweb/. The source code is available upon request. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Ondrej Vavra, Jiri Filipovic, Jan Plhak, David Bednar, Sérgio M. Marques, Jan Brezovsky, Jan Stourac, Ludek Matyska, Jirí Damborský |
Bioinform. | 8 |
| 2018 | INDIGO-DataCloud: a Platform to Facilitate Seamless Access to E-InfrastructuresabstractThis paper describes the achievements of the H2020 project INDIGO-DataCloud. The project has provided e-infrastructures with tools, applications and cloud framework enhancements to manage the demanding requirements of scientific communities, either locally or through enhanced interfaces. The middleware developed allows to federate hybrid resources, to easily write, port and run scientific applications to the cloud. In particular, we have extended existing PaaS (Platform as a Service) solutions, allowing public and private e-infrastructures, including those provided by EGI, EUDAT, and Helix Nebula, to integrate their existing services and make them available through AAI services compliant with GEANT interfederation policies, thus guaranteeing transparency and trust in the provisioning of such services. Our middleware facilitates the execution of applications using containers on Cloud and Grid based infrastructures, as well as on HPC clusters. Our developments are freely downloadable as open source components, and are already being integrated into many scientific applications. Davide Salomoni, Isabel Campos Plasencia, Luciano Gaido, Jesús E. Marco de Lucas, P. Solagna, Jorge Gomes 0001, Ludek Matyska, P. Fuhrman, Marcus Hardt, Giacinto Donvito, Lukasz Dutka, Marcin Plóciennik, Roberto Barbera, Ignacio Blanquer, Andrea Ceccanti, Eva Cetinic, Mário David, Doina Cristina Duma, Álvaro López García, Germán Moltó, Pablo Orviz Fernández, Zdenek Sustr, Matthew Viljoen, Fernando Aguilar, Marica Antonacci, Lucio Angelo Antonelli, Stefano Bagnasco, A. Bonving, Riccardo Bruno, Alessandro Costa, Davor Davidovic, Benjamin Ertl, Marco Fargetta, Sandro Fiore, S. Gallozzi, Z. Kurkcuoglu, Lara Lloret Iglesias, J. Martins, Alessandra Nuzzo, Paola Nassisi, Cosimo Palazzo, João Murta Pina, Eva Sciacca, Daniele Spiga, Marco Antonio Tangaro, Michal Urbaniak, Sara Vallero, Bas Wegh, Valentina Zaccolo, Federico Zambelli, Tomasz Zok |
J. Grid Comput. | 7 |
| 2015 | Optimizing CUDA code by kernel fusion: application on BLAS
Jiri Filipovic, Matus Madzin, Jan Fousek, Ludek Matyska |
J. Supercomput. | 4 |
| 2014 | On proper simulation of phenomena influencing image formation in fluorescence microscopyabstractThe simulation plays an important role in biomedical image analysis as it can inherently provide large collections of image data with absolute ground truth. Compared to real image data typically annotated by some expert, the computer generated data still lacks the authenticity due to the simplifications of various natural phenomena. In this paper, we focus on simulating the photobleaching effect and the uneven illumination, being simplified or even omitted from the majority of present simulation toolkits, to considerably improve the authenticity of computer generated data. David Svoboda, Vladimír Ulman, Ludek Matyska, Martin Maska, Jan Bella, Stanislav Stejskal |
ICIP | 3 |
| 2010 | Real-time visio-haptic interaction with static soft tissue models having geometric and material nonlinearity
Igor Peterlík, Mert Sedef, Cagatay Basdogan, Ludek Matyska |
Comput. Graph. | 4 |
| 2009 | VirtCloud: Virtualising Network for Grid EnvironmentsabstractNetworking infrastructure is a vital part of virtual computer clusters. This paper describes VirtCloud, a system for interconnecting virtual clusters in a state-wide network based on advanced features available in academic networks. The system supports dynamic creation of virtual clusters without the need of run-time administrative privileges on the backbone core network, encapsulation of the clusters, controlled access to external sources for cluster hosts, full user access to the clusters, and optional publishing of the clusters. The paper describes architecture of the system, and prototype implementation in MetaCenter (Czech national Grid infrastructure) using Czech national research network CESNET2. Feasibility of the concept is evaluated through a series of measurements demonstrating that the network performance of the system is satisfactory. David Antos, Ludek Matyska, Petr Holub, Jirí Sitera |
AINA | 2 |
| 2008 | Multiple Ligand Trajectory Docking Study - Semiautomatic Analysis of Molecular Dynamics Simulations using EGEE gLite ServicesabstractInteractions between large biomolecules and smaller bio-active ligands are usually studied through a process called docking. Its aim is to find an energetically favorable orientation of a ligand within an active site of abiomolecule. Chemical reactions take place in active siteand the role of the ligand is either to speed up, slow down or change the reaction (e.g., an enzyme catalyzed hydrolysis), which is why it can have huge pharmaceutical or other commercial impact. We present a tool that supports effective management and control of a typical workflow of docking parametric study. Selected subsets of ligands and protein trajectory snapshots can be displayed in three different views and further analyzed. Finally, the application supports spawning and steering underlying computations running on the Grid. Ales Krenek, Martin Petrek, Jan Kmunícek, Jiri Filipovic, Zdenek Sustr, Frantisek Dvorák, Jirí Sitera, Jiri Wiesner, Ludek Matyska |
PDP | 9 |
| 2008 | gLite Job Provenance - a job-centric viewabstractAbstract Job Provenance (JP), part of the gLite Grid middleware, is a service that keeps long‐term trace on completed computations for further reference. It is a job‐centric service, keeping records about job life cycle, its environment, inputs/outputs, user parameters, and annotations. During the first provenance challenge, we explored the relation between a specific job‐centric Grid‐oriented provenance and a more general data provenance approach. The challenge represents a use case which emphasizes fields that were not priorities in the original JP design. However, we proved that the design is sufficiently general to cope with this mode of use. We also identified several areas where it is feasible to extend the current implementation. Copyright © 2007 John Wiley & Sons, Ltd. Ales Krenek, Jirí Sitera, Ludek Matyska, Frantisek Dvorák, Milos Mulac, Miroslav Ruda, Zdenek Salvet |
Concurr. Comput. Pract. Exp. | 3 |
| 2007 | Transparent security for collaborative environmentsabstractCurrent collaborative tools are often not able to profit from existing systems for user management. It is therefore necessary for collaborative systems to administrate their users using their own solutions, which may not be adequate in terms of scalability or security. Many users may also experience problems working with authentication credentials (e.g. digital certificates) employed by collaborative systems. In this paper, we propose a general framework to provide easy-to-use yet secure access to collaborative systems, which offers a general middleware layer to accommodate various types of collaborative tools. The framework utilizes the emerging model of federations, which allows to provide a user-friendly means of logging in to a collaborative system as well as a solid basis for specifying access control policies. The framework handles all security aspects in a transparent way without requiring the users to perform complicated tasks. Using user attributes maintained in the federation, it is also possible to implement efficient and dynamic group management of the collaborating users. Eva Hladká, Daniel Kouril, Michal Procházka, Ludek Matyska, Petr Holub |
CollaborateCom | 4 |
| 2006 | High-definition multimedia for multiparty low-latency interactive communication
Petr Holub, Ludek Matyska, Milos Liska, Lukás Hejtmánek, Jirí Denemark, Tomás Rebok, Andrei Hutanu, Ravi Paruchuri, Jan Radil, Eva Hladká |
Future Gener. Comput. Syst. | 2 |
| 2006 | Distributed and collaborative visualization of large data sets using high-speed networks
Andrei Hutanu, Gabrielle Allen, Stephen David Beck, Petr Holub, Hartmut Kaiser, Archit Kulshrestha, Milos Liska, Jon MacLaren, Ludek Matyska, Ravi Paruchuri, Steffen Prohaska, Edward Seidel, Brygg Ullmer, Shalini Venkataraman |
Future Gener. Comput. Syst. | 9 |
| 2004 | The DataGrid Workload Management System: Challenges and Results
Giuseppe Avellino, Stefano Beco, Barbara Cantalupo, Alessandro Maraschini, Fabrizio Pacini, Massimo Sottilaro, Annalisa Terracina, Dave Colling, Francesco Giacomini, Elisabetta Ronchieri, Alessio Gianelle, Mirco Mazzucato, Rosario Peluso, Massimo Sgaravatto, Andrea Guarise, Rosario M. Piro, Albert Werbrouck, Daniel Kouril, Ales Krenek, Ludek Matyska, Milos Mulac, Jirí Pospísil, Miroslav Ruda, Zdenek Salvet, Jirí Sitera, J. Skrabal, Michal Vocu, M. Mezzadri, Francesco Prelz, Salvatore Monforte, Marco Pappalardo |
J. Grid Comput. | 20 |
| 2001 | Early Experiences with the EGrid TestbedabstractThe Testbed and Applications working group of the European Grid Forum (EGrid) is actively building and experimenting with a grid infrastructure connecting several research-based supercomputing sites located in Europe. The paper reports on our first feasibility study: running a self-migrating version of the Cactus simulation code across the European grid testbed, including "live" remote data visualization and steering from different demonstration booths at Supercomputing 2000, in Dallas, TX. We report on the problems that had to be resolved for this endeavour and identify open research challenges for building production-grade grid environments. Gabrielle Allen, Thomas Dramlitsch, Tom Goodale, Gerd Lanfermann, Thomas Radke, Edward Seidel, Thilo Kielmann, Kees Verstoep, Zoltán Balaton, Péter Kacsuk, Ferenc Szalai, Jörn Gehring, Axel Keller, Achim Streit, Ludek Matyska, Miroslav Ruda, Ales Krenek, Harald Knipp, André Merzky, Alexander Reinefeld, Florian Schintke, Bogdan Ludwiczak, Jarek Nabrzyski, Juliusz Pukacki, Hans-Peter Kersken, Giovanni Aloisio, Massimo Cafaro, Wolfgang Ziegler, Michael Russell |
CCGRID | 15 |
| 1996 | High Performance Computing - The Computational Chemistry Perspective
Ludek Matyska |
SOFSEM | 1 |
| 1995 | Constraint Logic Programming with Fuzzy Sets
Ludek Matyska, Hynek Bures |
SOFSEM | 1 |
| 1991 | Register Allocation in WAM
Ludek Matyska, Adriana Jergová, David Toman 0001 |
ICLP | 1 |