Christine Zarges
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
Christine Zarges has a total of 71 co-authors. Here are the top co-authors by number of shared publications:
- Thomas Jansen
Aberystwyth University
31 shared publications - Pietro Simone Oliveto
Southern University of Science and Technology
8 shared publications Dirk Sudholt
University of Sheffield, Sheffield, United Kingdom
6 shared publications- Amanda Clare
Department of Computer Science, Aberystwyth University, Aberystwyth, UK
3 shared publications Benjamin Doerr
Max Planck Institute for Informatics, Saarbrücken, Germany
3 shared publications- Dirk Sudholt
Chair of Algorithms for Intelligent Systems, University of Passau, Passau, Germany
3 shared publications
Latest Publications
- 25 August 2026
- Published by Springer Nature
- p. 83-98
Never-Forgetting Genetic Algorithms on OneMax: First Insights
- 25 August 2026
- Published by Springer Nature
- p. 83-98
Never-Forgetting Genetic Algorithms on OneMax: First Insights
- Open Access
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1340-1348
A Generic Framework for Optimisation under Uncertainty with Recourse: Theory and Examples
- 10 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1340-1348
Open AccessA Generic Framework for Optimisation under Uncertainty with Recourse: Theory and Examples
- Open Access
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 723-726
Evolutionary Neural Architecture Search using Random Weight Distributions
- 14 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 723-726
Open AccessEvolutionary Neural Architecture Search using Random Weight Distributions
- Open Access
- 28 January 2025
- Published by Springer Nature in Journal of Heuristics
- Vol. 31 (1) , 1-29
Heuristics for the run-length encoded Burrows–Wheeler transform alphabet ordering problem
The Burrows–Wheeler Transform (BWT) is a string transformation technique widely used in areas such as bioinformatics and file compression. Many applications combine a run-length encoding (RLE) with the BWT in a way which preserves the ability to query the compressed data efficiently. However, these methods may not take full advantage of the compressibility of the BWT as they do not modify the alphabet ordering for the sorting step embedded in computing the BWT. Indeed, any such alteration of the alphabet ordering can have a considerable impact on the output of the BWT, in particular on the number of runs. For an alphabet $$\Sigma $$ containing $$\sigma $$ characters, the space of all alphabet orderings is of size $$\sigma !$$ . While for small alphabets an exhaustive investigation is possible, finding the optimal ordering for larger alphabets is not feasible. Therefore, there is a need for a more informed search strategy than brute-force sampling the entire space, which motivates a new heuristic approach. In this paper, we explore the non-trivial cases for the problem of minimizing the size of a run-length encoded BWT (RLBWT) via selecting a new ordering for the alphabet. We show that random sampling of the space of alphabet orderings usually gives sub-optimal orderings for compression and that a local search strategy can provide a large improvement in relatively few steps. We also inspect a selection of initial alphabet orderings, including ASCII, letter appearance, and letter frequency. While this alphabet ordering problem is computationally hard we demonstrate gain in compressibility.- 28 January 2025
- Published by Springer Nature in Journal of Heuristics
- Vol. 31 (1) , 1-29
Open AccessHeuristics for the run-length encoded Burrows–Wheeler transform alphabet ordering problem
The Burrows–Wheeler Transform (BWT) is a string transformation technique widely used in areas such as bioinformatics and file compression. Many applications combine a run-length encoding (RLE) with the BWT in a way which preserves the ability to query the compressed data efficiently. However, these methods may not take full advantage of the compressibility of the BWT as they do not modify the alphabet ordering for the sorting step embedded in computing the BWT. Indeed, any such alteration of the alphabet ordering can have a considerable impact on the output of the BWT, in particular on the number of runs. For an alphabet $$\Sigma $$ containing $$\sigma $$ characters, the space of all alphabet orderings is of size $$\sigma !$$ . While for small alphabets an exhaustive investigation is possible, finding the optimal ordering for larger alphabets is not feasible. Therefore, there is a need for a more informed search strategy than brute-force sampling the entire space, which motivates a new heuristic approach. In this paper, we explore the non-trivial cases for the problem of minimizing the size of a run-length encoded BWT (RLBWT) via selecting a new ordering for the alphabet. We show that random sampling of the space of alphabet orderings usually gives sub-optimal orderings for compression and that a local search strategy can provide a large improvement in relatively few steps. We also inspect a selection of initial alphabet orderings, including ASCII, letter appearance, and letter frequency. While this alphabet ordering problem is computationally hard we demonstrate gain in compressibility. - 30 October 2024
- Published by Elsevier in Neurocomputing
- Vol. 614
Adversarial diffusion for few-shot scene adaptive video anomaly detection
- 30 October 2024
- Published by Elsevier in Neurocomputing
- Vol. 614
Adversarial diffusion for few-shot scene adaptive video anomaly detection
- 1 January 2024
- Published by Springer Nature
- p. 177-192
Experimental and Theoretical Analysis of Local Search Optimising OBDD Variable Orderings
- 1 January 2024
- Published by Springer Nature
- p. 177-192
Experimental and Theoretical Analysis of Local Search Optimising OBDD Variable Orderings
- 31 August 2020
- Published by Springer Nature
- p. 390-403
Evaluation of a Permutation-Based Evolutionary Framework for Lyndon Factorizations
- 31 August 2020
- Published by Springer Nature
- p. 390-403
Evaluation of a Permutation-Based Evolutionary Framework for Lyndon Factorizations
- Open Access
- 2 May 2020
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 62 (8) , 3321-3386
A scalable and effective rough set theory-based approach for big data pre-processing
A big challenge in the knowledge discovery process is to perform data pre-processing, specifically feature selection, on a large amount of data and high dimensional attribute set. A variety of techniques have been proposed in the literature to deal with this challenge with different degrees of success as most of these techniques need further information about the given input data for thresholding, need to specify noise levels or use some feature ranking procedures. To overcome these limitations, rough set theory (RST) can be used to discover the dependency within the data and reduce the number of attributes enclosed in an input data set while using the data alone and requiring no supplementary information. However, when it comes to massive data sets, RST reaches its limits as it is highly computationally expensive. In this paper, we propose a scalable and effective rough set theory-based approach for large-scale data pre-processing, specifically for feature selection, under the Spark framework. In our detailed experiments, data sets with up to 10,000 attributes have been considered, revealing that our proposed solution achieves a good speedup and performs its feature selection task well without sacrificing performance. Thus, making it relevant to big data.
- 2 May 2020
- Published by Springer Nature in Knowledge and Information Systems
- Vol. 62 (8) , 3321-3386
Open AccessA scalable and effective rough set theory-based approach for big data pre-processing
A big challenge in the knowledge discovery process is to perform data pre-processing, specifically feature selection, on a large amount of data and high dimensional attribute set. A variety of techniques have been proposed in the literature to deal with this challenge with different degrees of success as most of these techniques need further information about the given input data for thresholding, need to specify noise levels or use some feature ranking procedures. To overcome these limitations, rough set theory (RST) can be used to discover the dependency within the data and reduce the number of attributes enclosed in an input data set while using the data alone and requiring no supplementary information. However, when it comes to massive data sets, RST reaches its limits as it is highly computationally expensive. In this paper, we propose a scalable and effective rough set theory-based approach for large-scale data pre-processing, specifically for feature selection, under the Spark framework. In our detailed experiments, data sets with up to 10,000 attributes have been considered, revealing that our proposed solution achieves a good speedup and performs its feature selection task well without sacrificing performance. Thus, making it relevant to big data.
- 21 November 2019
- Published by Springer Nature
- p. 443-474
Theoretical Foundations of Immune-Inspired Randomized Search Heuristics for Optimization
- 21 November 2019
- Published by Springer Nature
- p. 443-474
Theoretical Foundations of Immune-Inspired Randomized Search Heuristics for Optimization
- Open Access
- 13 July 2019
- Published by Association for Computing Machinery (ACM)
- p. 427-428
Unlimited budget analysis
- 13 July 2019
- Published by Association for Computing Machinery (ACM)
- p. 427-428
Open AccessUnlimited budget analysis