Giulia Bernardini

Orcid: 0000-0001-6647-088X

Affiliations:
  • University of Trieste, Italy
  • University of Milano-Bicocca, Milan, Italy (2017-2020)
  • University of Pisa, Department of Mathematics, Italy (2014 - 2017)


According to our database1, Giulia Bernardini authored at least 29 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fixed points and attractors of reactantless and inhibitorless reaction systems.
Theor. Comput. Sci., February, 2024

2023
Preface.
J. Membr. Comput., December, 2023

Constructing phylogenetic networks via cherry picking and machine learning.
Algorithms Mol. Biol., December, 2023

Hide and Mine in Strings: Hardness, Algorithms, and Experiments.
IEEE Trans. Knowl. Data Eng., June, 2023

Substring Complexity in Sublinear Space.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
Elastic-Degenerate String Matching via Fast Matrix Multiplication.
SIAM J. Comput., 2022

Reconstructing Phylogenetic Networks via Cherry Picking and Machine Learning.
Proceedings of the 22nd International Workshop on Algorithms in Bioinformatics, 2022

A Universal Error Measure for Input Predictions Applied to Online Graph Problems.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Elastic-Degenerate String Matching with 1 Error.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Making de Bruijn Graphs Eulerian.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

On Strings Having the Same Length- k Substrings.
Proceedings of the 33rd Annual Symposium on Combinatorial Pattern Matching, 2022

2021
Combinatorial Algorithms for String Sanitization.
ACM Trans. Knowl. Discov. Data, 2021

Reverse-Safe Text Indexing.
ACM J. Exp. Algorithmics, 2021

Triplet-based similarity score for fully multilabeled trees with poly-occurring labels.
Bioinform., 2021

Incomplete Directed Perfect Phylogeny in Linear Time.
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021

Constructing Strings Avoiding Forbidden Substrings.
Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020
Approximate pattern matching on elastic-degenerate text.
Theor. Comput. Sci., 2020

Longest property-preserved common factor: A new string-processing framework.
Theor. Comput. Sci., 2020

Comparing Degenerate Strings.
Fundam. Informaticae, 2020

Hide and Mine in Strings: Hardness and Algorithms.
Proceedings of the 20th IEEE International Conference on Data Mining, 2020

String Sanitization Under Edit Distance.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

On Two Measures of Distance Between Fully-Labelled Trees.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

Reverse-Safe Data Structures for Text Indexing.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019
String Sanitization: A Combinatorial Approach.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2019

Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

A Rearrangement Distance for Fully-Labelled Trees.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Degenerate String Comparison and Applications.
Proceedings of the 18th International Workshop on Algorithms in Bioinformatics, 2018

Longest Property-Preserved Common Factor.
Proceedings of the String Processing and Information Retrieval, 2018

2017
Pattern Matching on Elastic-Degenerate Text with Errors.
Proceedings of the String Processing and Information Retrieval, 2017


  Loading...