Marek Běhálek
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Marek Běhálek has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Martin Šurkovský
VSB - Technical University of Ostrava
5 shared publications Stanislav Böhm
5 shared publicationsOndřej Meca
4 shared publicationsPetr Aloun
Dept. of Inf. & Comput., Univ. of Ostrava, Ostrava, Czech Republic
2 shared publicationsStanislav Bohm
2 shared publications- Stanislav Böhm
IT4Innovations, VŠB – Technical University of Ostrava, Ostrava, Czech Republic
2 shared publications
Latest Publications
- Open Access
- 21 January 2026
- Published by Oxford University Press (OUP) in GigaScience
- Vol. 15
Multiplatform comparisons and annotation of structural variants highlight the utility of the T2T reference genome in human diagnostics
Background: Structural variants (SVs) are increasingly recognized as key contributors to human diseases. However, our understanding of SVs in health and disease is limited, mainly due to their structural complexity and variable length in individuals, as well as limitations inherent to the available genomic technologies and reference genome used. Results: To systematically evaluate SVs across human whole-genome samples using hg38/GRCh38 and gapless T2T-CHM13 references, we introduced an innovative multiplatform approach, LongReadChecker (LoReC), which advances SV comparison and annotation based on distance variance, intersection, gene overlap, and the closest SV in the clinical database. Comparison of the performance in detecting SVs from public and our own whole-genome datasets from short-read sequencing (SRS), available long-read sequencing (LRS) platforms, and optical genome mapping (OGM) revealed that most SVs detected by SRS were confirmed by LRS, but LRS can identify twice as many SVs (25,000 SVs/genome) with greater read mapping accuracy. Our LongReadChecker (LoReC) analysis further highlights the utility of the T2T-CHM13 reference in SV detection, as 20% more deletions and 20% less insertions were detected compared with hg38/GRCh38, which was particularly evident in long-read datasets. Since 80% of the SVs detected by LRS/SRS are smaller than 0.5 kbp, OGM did not detect them. Conclusions: Our study revealed that introducing distance variance, intersection, gene overlap, and the closest SV in the clinical database may help compare and annotate SVs in diagnostics. Our data showed that LRS, together with T2T-CHM13 gapless sequences, can improve the diagnostics of patients with human diseases when SRS fails to identify the cause.
- 21 January 2026
- Published by Oxford University Press (OUP) in GigaScience
- Vol. 15
Open AccessMultiplatform comparisons and annotation of structural variants highlight the utility of the T2T reference genome in human diagnostics
Background: Structural variants (SVs) are increasingly recognized as key contributors to human diseases. However, our understanding of SVs in health and disease is limited, mainly due to their structural complexity and variable length in individuals, as well as limitations inherent to the available genomic technologies and reference genome used. Results: To systematically evaluate SVs across human whole-genome samples using hg38/GRCh38 and gapless T2T-CHM13 references, we introduced an innovative multiplatform approach, LongReadChecker (LoReC), which advances SV comparison and annotation based on distance variance, intersection, gene overlap, and the closest SV in the clinical database. Comparison of the performance in detecting SVs from public and our own whole-genome datasets from short-read sequencing (SRS), available long-read sequencing (LRS) platforms, and optical genome mapping (OGM) revealed that most SVs detected by SRS were confirmed by LRS, but LRS can identify twice as many SVs (25,000 SVs/genome) with greater read mapping accuracy. Our LongReadChecker (LoReC) analysis further highlights the utility of the T2T-CHM13 reference in SV detection, as 20% more deletions and 20% less insertions were detected compared with hg38/GRCh38, which was particularly evident in long-read datasets. Since 80% of the SVs detected by LRS/SRS are smaller than 0.5 kbp, OGM did not detect them. Conclusions: Our study revealed that introducing distance variance, intersection, gene overlap, and the closest SV in the clinical database may help compare and annotate SVs in diagnostics. Our data showed that LRS, together with T2T-CHM13 gapless sequences, can improve the diagnostics of patients with human diseases when SRS fails to identify the cause.
- 17 August 2022
- Published by Springer Nature
- p. 393-402
Restriction Site Detection in Optical Mapping Data
- 17 August 2022
- Published by Springer Nature
- p. 393-402
Restriction Site Detection in Optical Mapping Data
- 1 January 2017
- Published by IGI Global Scientific Publishing
- p. 326-347
On Interdisciplinary Intersection of Unconventional Algorithms and Big Data Processing in Real World Problems
Optimization algorithms are a powerful tool for solving many problems of engineering applications from different fields of real life. They are usually used where the solution of a given problem analytically is unsuitable or unrealistic. If implemented in a suitable manner, there is no need for frequent user intervention into the actions of the equipment in which they are used. The majority of the problems of real life applications can be defined as optimization problems, for example, finding the optimum trajectory of a robot, optimal data flows in various processes like city traffic optimization or modelling and optimization of the seasonal variances of supply, traffic and facilities occupation in tourism among the others. The structure of this chapter is such that on the beginning are introduced bio-inspired algorithms, then parallelization of algorithms and parallel hardware and at the end, open research on Ho Chi Minh City traffic optimization real world example is introduced. In Conclusion are discussed possibilities of mutual combinations of introduced methods.
- 1 January 2017
- Published by IGI Global Scientific Publishing
- p. 326-347
On Interdisciplinary Intersection of Unconventional Algorithms and Big Data Processing in Real World Problems
Optimization algorithms are a powerful tool for solving many problems of engineering applications from different fields of real life. They are usually used where the solution of a given problem analytically is unsuitable or unrealistic. If implemented in a suitable manner, there is no need for frequent user intervention into the actions of the equipment in which they are used. The majority of the problems of real life applications can be defined as optimization problems, for example, finding the optimum trajectory of a robot, optimal data flows in various processes like city traffic optimization or modelling and optimization of the seasonal variances of supply, traffic and facilities occupation in tourism among the others. The structure of this chapter is such that on the beginning are introduced bio-inspired algorithms, then parallelization of algorithms and parallel hardware and at the end, open research on Ho Chi Minh City traffic optimization real world example is introduced. In Conclusion are discussed possibilities of mutual combinations of introduced methods.
- 5 February 2016
- Published by Springer Nature
- p. 121-145
Utilization of Parallel Computing for Discrete Self-organizing Migration Algorithm
- 5 February 2016
- Published by Springer Nature
- p. 121-145
Utilization of Parallel Computing for Discrete Self-organizing Migration Algorithm
- 1 January 2015
- Published by Czech Technical University in Prague - Central Library in Neural Network World
- Vol. 25 (2) , 161-174
MEMORY OPTIMIZED PHEROMONE STRUCTURES FOR MAX-MIN ANT SYSTEM
- 1 January 2015
- Published by Czech Technical University in Prague - Central Library in Neural Network World
- Vol. 25 (2) , 161-174
MEMORY OPTIMIZED PHEROMONE STRUCTURES FOR MAX-MIN ANT SYSTEM
- 8 May 2014
- Published by Springer Nature
- p. 95-104
Prototyping Framework for Parallel Numerical Computations
- 8 May 2014
- Published by Springer Nature
- p. 95-104
Prototyping Framework for Parallel Numerical Computations
- Open Access
- 1 January 2014
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 11 (4) , 1315-1336
Visual programming of MPI applications: Debugging, performance analysis, and performance prediction
In our research, we try to simplify the development of parallel applications in the area of the scientific and engineering computations for distributed memory systems. The difficulties of this task lie not only in programming itself, but also in a complexity of supportive activities like debugging and performance analyses. We are developing a unifying framework where it is possible to create parallel applications and perform various supportive activities. The unifying element, that interconnects all these activities, is our visual model that is inspired by Colored Petri Nets. It is used to define the parallel behavior and the same model is used to show the inner state of the developed application back to the user. This paper presents how to extend this approach for debugging, tracing, and performance predictions. It also presents benefits obtained by their interconnection. The presented ideas are integrated into our open source tool Kaira (http://verif.cs.vsb.cz/kaira). Kaira is a prototyping tool, where a user can implement his/her ideas and experiment with them in a short time, create a real running program and verify its performance and scalability.
- 1 January 2014
- Published by National Library of Serbia in Computer Science and Information Systems
- Vol. 11 (4) , 1315-1336
Open AccessVisual programming of MPI applications: Debugging, performance analysis, and performance prediction
In our research, we try to simplify the development of parallel applications in the area of the scientific and engineering computations for distributed memory systems. The difficulties of this task lie not only in programming itself, but also in a complexity of supportive activities like debugging and performance analyses. We are developing a unifying framework where it is possible to create parallel applications and perform various supportive activities. The unifying element, that interconnects all these activities, is our visual model that is inspired by Colored Petri Nets. It is used to define the parallel behavior and the same model is used to show the inner state of the developed application back to the user. This paper presents how to extend this approach for debugging, tracing, and performance predictions. It also presents benefits obtained by their interconnection. The presented ideas are integrated into our open source tool Kaira (http://verif.cs.vsb.cz/kaira). Kaira is a prototyping tool, where a user can implement his/her ideas and experiment with them in a short time, create a real running program and verify its performance and scalability.
- 1 January 2014
- Published by Springer Nature
- p. 385-394
Kaira: Development Environment for MPI Applications
- 1 January 2014
- Published by Springer Nature
- p. 385-394
Kaira: Development Environment for MPI Applications
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 268-269
Kaira: Generating Parallel Libraries and Their Usage with Octave
- 1 January 2013
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 268-269
Kaira: Generating Parallel Libraries and Their Usage with Octave
- Open Access
- 15 September 2012
- Published by Association for Computing Machinery (ACM)
- p. 37-48
Usage of petri nets for high performance computing
Petri nets are a well established graphical and mathematical modelling language for a description of concurrent systems. The main scope of this paper is to present our approach how to use Petri nets for high-performance computing. They are rarely used in this area. As a proof of concept, we are developing a tool Kaira. The modelling language in the tool is based on our extension of Coloured Petri Nets. The basic concept is to use a visual language to model parallel behaviour and communication. Sequential parts of a program are written in C/C++. In contrast to other Petri Nets based tools, Kaira is not intended only for modelling and simulation, but it can also generate standalone parallel applications from models. Generated applications use MPI and threads. This paper also presents new Kaira's features including modules for computations on structured objects, more controllable semantics of mapping to MPI processes and a support for the hybrid computing.
- 15 September 2012
- Published by Association for Computing Machinery (ACM)
- p. 37-48
Open AccessUsage of petri nets for high performance computing
Petri nets are a well established graphical and mathematical modelling language for a description of concurrent systems. The main scope of this paper is to present our approach how to use Petri nets for high-performance computing. They are rarely used in this area. As a proof of concept, we are developing a tool Kaira. The modelling language in the tool is based on our extension of Coloured Petri Nets. The basic concept is to use a visual language to model parallel behaviour and communication. Sequential parts of a program are written in C/C++. In contrast to other Petri Nets based tools, Kaira is not intended only for modelling and simulation, but it can also generate standalone parallel applications from models. Generated applications use MPI and threads. This paper also presents new Kaira's features including modules for computations on structured objects, more controllable semantics of mapping to MPI processes and a support for the hybrid computing.