Mai Abdulaziz Alzamel

Zara Lim

Marie Moser-Schwaiger

Proceedings of the Artificial Intelligence Applications and Innovations, 2024

2023

Maximal degenerate palindromes with gaps and mismatches.

[BibT_eX]

[DOI]

Theor. Comput. Sci., November, 2023

Preface: MatBio 2021 Special Section.

[BibT_eX]

[DOI]

J. Comput. Biol., February, 2023

Local Maximal Equality-Free Periodicities.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Applications and Innovations. AIAI 2023 IFIP WG 12.5 International Workshops, 2023

Advanced Skin Cancer Detection Using Deep Learning.

[BibT_eX]

[DOI]

Proceedings of the Engineering Applications of Neural Networks, 2023

2022

Special Issue of Algorithmica for the 28th London Stringology Days & London Algorithmic Workshop (LSD & LAW).

[BibT_eX]

[DOI]

Algorithmica, 2022

2021

IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences.

[BibT_eX]

[DOI]

BMC Bioinform., 2021

2020

Faster algorithms for 1-mappability of a sequence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Efficient Identification of k-Closed Strings.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2020

Preface.

[BibT_eX]

[DOI]

Inf. Comput., 2020

Comparing Degenerate Strings.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2020

GenMap: ultra-fast computation of genome mappability.

[BibT_eX]

[DOI]

Christopher Pockrandt

Knut Reinert

Bioinform., 2020

Finding the Anticover of a String.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019

Off-line and on-line algorithms for closed string factorization.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Online Algorithms on Antipowers and Antiperiods.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2019

A Brief Overview of Dead-Zone Pattern Matching Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Applications and Innovations, 2019

On the Cyclic Regularities of Strings.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Applications and Innovations, 2019

Quasi-Linear-Time Algorithm for Longest Common Circular Factor.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Palindromic Decompositions with Gaps and Errors.

[BibT_eX]

[DOI]

Michal Adamczyk

Jakub Radoszewski

Int. J. Found. Comput. Sci., 2018

Efficient Computation of Palindromes in Sequences with Uncertainties.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

Degenerate String Comparison and Applications.

[BibT_eX]

[DOI]

Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Efficient Computation of Sequence Mappability.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2018

How Much Different Are Two Words with Different Shortest Periods.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence Applications and Innovations, 2018

2017

Recent Advances of Palindromic Factorization.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

How to Answer a Small Batch of RMQs or LCA Queries in Practice.

[BibT_eX]

[DOI]

Solon P. Pissis

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

Efficient Computation of Palindromes in Sequences with Uncertainties.

[BibT_eX]

[DOI]

Proceedings of the Engineering Applications of Neural Networks, 2017

Palindromic Decompositions with Gaps and Errors.

[BibT_eX]

[DOI]

Michal Adamczyk