Piotr Bała
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
Piotr Bała has a total of 204 co-authors. Here are the top co-authors by number of shared publications:
Krzysztof Benedyczak
Interdisciplinary Centre for Mathematical and Computational Modelling, University of Warsaw, Poland
14 shared publications- Marek Nowicki
Nicolaus Copernicus University
13 shared publications B. Lesyng
Department of Biophysics, Faculty of Physics, Warsaw University, Żwirki i Wigury 93, 02‐089 Warszawa, Poland
9 shared publications- Aleksander Nowiński
Warsaw University
7 shared publications Krzysztof Nowiński
7 shared publicationsMarcelina Borcz
Interdisciplinary Centre for Mathematical and Computational Modelling, University of Warsaw, 5a Pawinskiego Street, 02-106 Warsaw, Poland
6 shared publications
Latest Publications
- Open Access
- 4 March 2025
- Published by Oxford University Press (OUP) in Briefings in Bioinformatics
- Vol. 26 (2)
HPV-KITE: sequence analysis software for rapid HPV genotype detection
Human papillomaviruses (HPVs) are among the most diverse viral families that infect humans. Fortunately, only a small number of closely related HPV types affect human health, most notably by causing nearly all cervical cancers, as well as some oral and other anogenital cancers, particularly when infections with high-risk HPV types become persistent. Numerous viral polymerase chain reaction-based diagnostic methods as well as sequencing protocols have been developed for accurate, rapid, and efficient HPV genotyping. However, due to the large number of closely related HPV genotypes and the abundance of nonviral DNA in human derived biological samples, it can be challenging to correctly detect HPV genotypes using high throughput deep sequencing. Here, we introduce a novel HPV detection algorithm, HPV-KITE (HPV K-mer Index Tversky Estimator), which leverages k-mer data analysis and utilizes Tversky indexing for DNA and RNA sequence data. This method offers a rapid and sensitive alternative for detecting HPV from both metagenomic and transcriptomic datasets. We assessed HPV-KITE using three previously analyzed HPV infection-related datasets, comprising a total of 1430 sequenced human samples. For benchmarking, we compared our method’s performance with standard HPV sequencing analysis algorithms, including general sequence-based mapping, and k-mer-based classification methods. Parallelization demonstrated fast processing times achieved through shingling, and scalability analysis revealed optimal performance when employing multiple nodes. Our results showed that HPV-KITE is one of the fastest, most accurate, and easiest ways to detect HPV genotypes from virtually any next-generation sequencing data. Moreover, the method is also highly scalable and available to be optimized for any microorganism other than HPV.
- 4 March 2025
- Published by Oxford University Press (OUP) in Briefings in Bioinformatics
- Vol. 26 (2)
Open AccessHPV-KITE: sequence analysis software for rapid HPV genotype detection
Human papillomaviruses (HPVs) are among the most diverse viral families that infect humans. Fortunately, only a small number of closely related HPV types affect human health, most notably by causing nearly all cervical cancers, as well as some oral and other anogenital cancers, particularly when infections with high-risk HPV types become persistent. Numerous viral polymerase chain reaction-based diagnostic methods as well as sequencing protocols have been developed for accurate, rapid, and efficient HPV genotyping. However, due to the large number of closely related HPV genotypes and the abundance of nonviral DNA in human derived biological samples, it can be challenging to correctly detect HPV genotypes using high throughput deep sequencing. Here, we introduce a novel HPV detection algorithm, HPV-KITE (HPV K-mer Index Tversky Estimator), which leverages k-mer data analysis and utilizes Tversky indexing for DNA and RNA sequence data. This method offers a rapid and sensitive alternative for detecting HPV from both metagenomic and transcriptomic datasets. We assessed HPV-KITE using three previously analyzed HPV infection-related datasets, comprising a total of 1430 sequenced human samples. For benchmarking, we compared our method’s performance with standard HPV sequencing analysis algorithms, including general sequence-based mapping, and k-mer-based classification methods. Parallelization demonstrated fast processing times achieved through shingling, and scalability analysis revealed optimal performance when employing multiple nodes. Our results showed that HPV-KITE is one of the fastest, most accurate, and easiest ways to detect HPV genotypes from virtually any next-generation sequencing data. Moreover, the method is also highly scalable and available to be optimized for any microorganism other than HPV.
- 2 August 2021
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 35 (15) , e6536
Performance evaluation of Java/PCJ implementation of parallel algorithms on the cloud (extended version)
Large‐scale computing and data processing with cloud resources is gaining popularity. However, the usage of the cloud differs from traditional high‐performance computing (HPC) systems and both algorithms and codes have to be adjusted. This work is often time‐consuming and performance is not guaranteed. To address this problem we have developed the PCJ library (parallel computing in Java), a novel tool for scalable HPC and big data processing in Java. In this article, we present a performance evaluation of parallel applications implemented in Java using the PCJ library. The performance evaluation is based on the examples of highly scalable applications of different characteristics focusing on CPU, communication or I/O. They run on the traditional HPC system and Amazon web services Cloud as well as Linaro Developer Cloud. For the clouds, we have used Intel x86 and ARM processors for running Java codes without changing any line of the program code and without the need for time‐consuming recompilation. Presented applications have been parallelized using the partitioned global address space programming model and its realization in the PCJ library. Our results prove that the PCJ library, due to its performance and ability to create simple portable code, has great promise to be successful for the parallelization of various applications and run them on the cloud with a performance close to HPC systems.
- 2 August 2021
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 35 (15) , e6536
Performance evaluation of Java/PCJ implementation of parallel algorithms on the cloud (extended version)
Large‐scale computing and data processing with cloud resources is gaining popularity. However, the usage of the cloud differs from traditional high‐performance computing (HPC) systems and both algorithms and codes have to be adjusted. This work is often time‐consuming and performance is not guaranteed. To address this problem we have developed the PCJ library (parallel computing in Java), a novel tool for scalable HPC and big data processing in Java. In this article, we present a performance evaluation of parallel applications implemented in Java using the PCJ library. The performance evaluation is based on the examples of highly scalable applications of different characteristics focusing on CPU, communication or I/O. They run on the traditional HPC system and Amazon web services Cloud as well as Linaro Developer Cloud. For the clouds, we have used Intel x86 and ARM processors for running Java codes without changing any line of the program code and without the need for time‐consuming recompilation. Presented applications have been parallelized using the partitioned global address space programming model and its realization in the PCJ library. Our results prove that the PCJ library, due to its performance and ability to create simple portable code, has great promise to be successful for the parallelization of various applications and run them on the cloud with a performance close to HPC systems.
- Open Access
- 26 April 2021
- Published by Springer Nature in Journal of Big Data
- Vol. 8 (1) , 1-21
PCJ Java library as a solution to integrate HPC, Big Data and Artificial Intelligence workloads
With the development of peta- and exascale size computational systems there is growing interest in running Big Data and Artificial Intelligence (AI) applications on them. Big Data and AI applications are implemented in Java, Scala, Python and other languages that are not widely used in High-Performance Computing (HPC) which is still dominated by C and Fortran. Moreover, they are based on dedicated environments such as Hadoop or Spark which are difficult to integrate with the traditional HPC management systems. We have developed the Parallel Computing in Java (PCJ) library, a tool for scalable high-performance computing and Big Data processing in Java. In this paper, we present the basic functionality of the PCJ library with examples of highly scalable applications running on the large resources. The performance results are presented for different classes of applications including traditional computational intensive (HPC) workloads (e.g. stencil), as well as communication-intensive algorithms such as Fast Fourier Transform (FFT). We present implementation details and performance results for Big Data type processing running on petascale size systems. The examples of large scale AI workloads parallelized using PCJ are presented.
- 26 April 2021
- Published by Springer Nature in Journal of Big Data
- Vol. 8 (1) , 1-21
Open AccessPCJ Java library as a solution to integrate HPC, Big Data and Artificial Intelligence workloads
With the development of peta- and exascale size computational systems there is growing interest in running Big Data and Artificial Intelligence (AI) applications on them. Big Data and AI applications are implemented in Java, Scala, Python and other languages that are not widely used in High-Performance Computing (HPC) which is still dominated by C and Fortran. Moreover, they are based on dedicated environments such as Hadoop or Spark which are difficult to integrate with the traditional HPC management systems. We have developed the Parallel Computing in Java (PCJ) library, a tool for scalable high-performance computing and Big Data processing in Java. In this paper, we present the basic functionality of the PCJ library with examples of highly scalable applications running on the large resources. The performance results are presented for different classes of applications including traditional computational intensive (HPC) workloads (e.g. stencil), as well as communication-intensive algorithms such as Fast Fourier Transform (FFT). We present implementation details and performance results for Big Data type processing running on petascale size systems. The examples of large scale AI workloads parallelized using PCJ are presented.
- 14 March 2021
- Published by Springer Nature
- Vol. 12480, 213-224
Performance Evaluation of Java/PCJ Implementation of Parallel Algorithms on the Cloud
Cloud resources are more often used for large scale computing and data processing. However, the usage of the cloud is different than traditional High-Performance Computing (HPC) systems and both algorithms and codes have to be adjusted. This work is often time-consuming and performance is not guaranteed. To address this problem we have developed the PCJ library (Parallel Computing in Java), a novel tool for scalable high-performance computing and big data processing in Java. In this paper, we present a performance evaluation of parallel applications implemented in Java using the PCJ library. The performance evaluation is based on the examples of highly scalable applications that run on the traditional HPC system and Amazon AWS Cloud. For the cloud, we have used Intel x86 and ARM processors running Java codes without changing any line of the program code and without the need for time-consuming recompilation. Presented applications have been parallelized using the PGAS programming model and its realization in the PCJ library. Our results prove that the PCJ library, due to its performance and ability to create simple portable code, has great promise to be successful for the parallelization of various applications and run them on the cloud with a similar performance as for HPC systems.
- 14 March 2021
- Published by Springer Nature
- Vol. 12480, 213-224
Performance Evaluation of Java/PCJ Implementation of Parallel Algorithms on the Cloud
Cloud resources are more often used for large scale computing and data processing. However, the usage of the cloud is different than traditional High-Performance Computing (HPC) systems and both algorithms and codes have to be adjusted. This work is often time-consuming and performance is not guaranteed. To address this problem we have developed the PCJ library (Parallel Computing in Java), a novel tool for scalable high-performance computing and big data processing in Java. In this paper, we present a performance evaluation of parallel applications implemented in Java using the PCJ library. The performance evaluation is based on the examples of highly scalable applications that run on the traditional HPC system and Amazon AWS Cloud. For the cloud, we have used Intel x86 and ARM processors running Java codes without changing any line of the program code and without the need for time-consuming recompilation. Presented applications have been parallelized using the PGAS programming model and its realization in the PCJ library. Our results prove that the PCJ library, due to its performance and ability to create simple portable code, has great promise to be successful for the parallelization of various applications and run them on the cloud with a similar performance as for HPC systems.
- Open Access
- 24 September 2018
- Published by Springer Nature in BMC Bioinformatics
- Vol. 19 (1) , 1-11
Machine Learning for detection of viral sequences in human metagenomic datasets
Detection of highly divergent or yet unknown viruses from metagenomics sequencing datasets is a major bioinformatics challenge. When human samples are sequenced, a large proportion of assembled contigs are classified as “unknown”, as conventional methods find no similarity to known sequences. We wished to explore whether machine learning algorithms using Relative Synonymous Codon Usage frequency (RSCU) could improve the detection of viral sequences in metagenomic sequencing data. We trained Random Forest and Artificial Neural Network using metagenomic sequences taxonomically classified into virus and non-virus classes. The algorithms achieved accuracies well beyond chance level, with area under ROC curve 0.79. Two codons (TCG and CGC) were found to have a particularly strong discriminative capacity. RSCU-based machine learning techniques applied to metagenomic sequencing data can help identify a large number of putative viral sequences and provide an addition to conventional methods for taxonomic classification.
- 24 September 2018
- Published by Springer Nature in BMC Bioinformatics
- Vol. 19 (1) , 1-11
Open AccessMachine Learning for detection of viral sequences in human metagenomic datasets
Detection of highly divergent or yet unknown viruses from metagenomics sequencing datasets is a major bioinformatics challenge. When human samples are sequenced, a large proportion of assembled contigs are classified as “unknown”, as conventional methods find no similarity to known sequences. We wished to explore whether machine learning algorithms using Relative Synonymous Codon Usage frequency (RSCU) could improve the detection of viral sequences in metagenomic sequencing data. We trained Random Forest and Artificial Neural Network using metagenomic sequences taxonomically classified into virus and non-virus classes. The algorithms achieved accuracies well beyond chance level, with area under ROC curve 0.79. Two codons (TCG and CGC) were found to have a particularly strong discriminative capacity. RSCU-based machine learning techniques applied to metagenomic sequencing data can help identify a large number of putative viral sequences and provide an addition to conventional methods for taxonomic classification.
- 23 March 2018
- Published by Springer Nature
- p. 288-297
Evaluation of the Parallel Performance of the Java and PCJ on the Intel KNL Based Systems
- 23 March 2018
- Published by Springer Nature
- p. 288-297
Evaluation of the Parallel Performance of the Java and PCJ on the Intel KNL Based Systems
- 23 March 2018
- Published by Springer Nature
- p. 318-327
Big Data Analytics in Java with PCJ Library: Performance Comparison with Hadoop
- 23 March 2018
- Published by Springer Nature
- p. 318-327
Big Data Analytics in Java with PCJ Library: Performance Comparison with Hadoop
- 11 August 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 503-512
Massively Parallel Sequence Alignment with BLAST Through Work Distribution Implemented Using PCJ Library
- 11 August 2017
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 503-512
Massively Parallel Sequence Alignment with BLAST Through Work Distribution Implemented Using PCJ Library
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 596-601
Level-Synchronous BFS Algorithm Implemented in Java Using PCJ Library
Graph processing is used in many fields of science such as sociology, risk prediction or biology. Although analysis of graphs is important it also poses numerous challenges especially for large graphs which have to be processed on multicore systems. In this paper, we present PGAS (Partitioned Global Address Space) version of the level-synchronous BFS (Breadth First Search) algorithm and its implementation written in Java. Java so far is not extensively used in high performance computing, but because of its popularity, portability, and increasing capabilities is becoming more widely exploit especially for data analysis. The level-synchronous BFS has been implemented using a PCJ (Parallel Computations in Java) library. In this paper, we present implementation details and compare its scalability and performance with the MPI implementation of Graph500 benchmark. We show good scalability and performance of our implementation in comparison with MPI code written in C. We present challenges we faced and optimizations we used in our implementation necessary to obtain good performance.
- 1 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 596-601
Level-Synchronous BFS Algorithm Implemented in Java Using PCJ Library
Graph processing is used in many fields of science such as sociology, risk prediction or biology. Although analysis of graphs is important it also poses numerous challenges especially for large graphs which have to be processed on multicore systems. In this paper, we present PGAS (Partitioned Global Address Space) version of the level-synchronous BFS (Breadth First Search) algorithm and its implementation written in Java. Java so far is not extensively used in high performance computing, but because of its popularity, portability, and increasing capabilities is becoming more widely exploit especially for data analysis. The level-synchronous BFS has been implemented using a PCJ (Parallel Computations in Java) library. In this paper, we present implementation details and compare its scalability and performance with the MPI implementation of Graph500 benchmark. We show good scalability and performance of our implementation in comparison with MPI code written in C. We present challenges we faced and optimizations we used in our implementation necessary to obtain good performance.
- 15 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 443-448
A case study of software load balancing policies implemented with the PGAS programming model
Differential evolution algorithm was used to calculate the parameters C. Elegans connectome model. The calculations were carried out using the Java programming language coupled with PCJ library that enabled PGAS features within the JVM. The calculations clearly exhibited load imbalance, as some of the program's threads of execution were taking three times longer to complete the calculations compared to the fastest one. The computing resources were thus used sub-optimally. The paper describes the steps undertaken to mitigate the problem. Three software load balancing strategies are described, and performance results are discussed.
- 15 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 443-448
A case study of software load balancing policies implemented with the PGAS programming model
Differential evolution algorithm was used to calculate the parameters C. Elegans connectome model. The calculations were carried out using the Java programming language coupled with PCJ library that enabled PGAS features within the JVM. The calculations clearly exhibited load imbalance, as some of the program's threads of execution were taking three times longer to complete the calculations compared to the fastest one. The computing resources were thus used sub-optimally. The paper describes the steps undertaken to mitigate the problem. Three software load balancing strategies are described, and performance results are discussed.