default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGiulia Bernardini 0001
Person information
- affiliation: University of Trieste, Italy
- affiliation (2017-2020): University of Milano-Bicocca, Milan, Italy
- affiliation (2014 - 2017): University of Pisa, Department of Mathematics, Italy
- not to be confused with: Giulia Bernardini 0002
Other persons with the same name
- Giulia Bernardini 0002 — University of Pisa, Department of Information Engineering, Italy
- Giulia Bernardini 0003 — University of Siena, Department of Biotechnology, Chemistry and Pharmacy, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j13]Rocco Ascone, Giulia Bernardini, Enrico Formenti, Francesco Leiter, Luca Manzoni:
Pure reaction automata. Nat. Comput. 23(2): 189-204 (2024)- [j12]Rocco Ascone, Giulia Bernardini, Luca Manzoni:
Fixed points and attractors of additive reaction systems. Nat. Comput. 23(2): 205-215 (2024) - [j11]Rocco Ascone
, Giulia Bernardini, Luca Manzoni:
Fixed points and attractors of reactantless and inhibitorless reaction systems. Theor. Comput. Sci. 984: 114322 (2024) - 2023
- [j10]Giulia Bernardini, Leo van Iersel, Esther Julien, Leen Stougie:
Constructing phylogenetic networks via cherry picking and machine learning. Algorithms Mol. Biol. 18(1): 13 (2023) - [j9]Henry Adorna, Giulia Bernardini, Luca Manzoni, Claudio Zandron:
Preface. J. Membr. Comput. 5(4): 252-253 (2023) - [j8]Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering:
Hide and Mine in Strings: Hardness, Algorithms, and Experiments. IEEE Trans. Knowl. Data Eng. 35(6): 5948-5963 (2023) - 2022
- [j7]Giulia Bernardini, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Elastic-Degenerate String Matching via Fast Matrix Multiplication. SIAM J. Comput. 51(3): 549-576 (2022) - 2021
- [j6]Simone Ciccolella, Giulia Bernardini, Luca Denti, Paola Bonizzoni, Marco Previtali, Gianluca Della Vedova:
Triplet-based similarity score for fully multilabeled trees with poly-occurring labels. Bioinform. 37(2): 178-184 (2021) - [j5]Giulia Bernardini, Huiping Chen, Gabriele Fici, Grigorios Loukides, Solon P. Pissis:
Reverse-Safe Text Indexing. ACM J. Exp. Algorithmics 26: 1.10:1-1.10:26 (2021) - [j4]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone, Michelle Sweering:
Combinatorial Algorithms for String Sanitization. ACM Trans. Knowl. Discov. Data 15(1): 8:1-8:34 (2021) - 2020
- [j3]Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Comparing Degenerate Strings. Fundam. Informaticae 175(1-4): 41-58 (2020) - [j2]Giulia Bernardini, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Approximate pattern matching on elastic-degenerate text. Theor. Comput. Sci. 812: 109-122 (2020) - [j1]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest property-preserved common factor: A new string-processing framework. Theor. Comput. Sci. 812: 244-251 (2020)
Conference and Workshop Papers
- 2024
- [c21]Giulia Bernardini, Huiping Chen, Inge Li Gørtz, Christoffer Krogh, Grigorios Loukides, Solon P. Pissis, Leen Stougie, Michelle Sweering:
Connecting de Bruijn Graphs. CPM 2024: 6:1-6:16 - [c20]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Veronica Guerrini, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis:
Utility-Oriented String Mining. SDM 2024: 190-198 - [c19]Rocco Ascone, Giulia Bernardini, Alessio Conte, Massimo Equi, Estéban Gabory, Roberto Grossi, Nadia Pisanti:
A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs. WABI 2024: 14:1-14:21 - 2023
- [c18]Giulia Bernardini, Gabriele Fici, Pawel Gawrychowski, Solon P. Pissis:
Substring Complexity in Sublinear Space. ISAAC 2023: 12:1-12:19 - 2022
- [c17]Giulia Bernardini, Huiping Chen, Grigorios Loukides, Solon P. Pissis, Leen Stougie, Michelle Sweering:
Making de Bruijn Graphs Eulerian. CPM 2022: 12:1-12:18 - [c16]Giulia Bernardini, Alessio Conte, Estéban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering:
On Strings Having the Same Length- k Substrings. CPM 2022: 16:1-16:17 - [c15]Giulia Bernardini, Estéban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering, Wiktor Zuba:
Elastic-Degenerate String Matching with 1 Error. LATIN 2022: 20-37 - [c14]Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie, Michelle Sweering:
A Universal Error Measure for Input Predictions Applied to Online Graph Problems. NeurIPS 2022 - [c13]Giulia Bernardini, Leo van Iersel, Esther Julien, Leen Stougie:
Reconstructing Phylogenetic Networks via Cherry Picking and Machine Learning. WABI 2022: 16:1-16:22 - 2021
- [c12]Giulia Bernardini, Alberto Marchetti-Spaccamela, Solon P. Pissis, Leen Stougie, Michelle Sweering:
Constructing Strings Avoiding Forbidden Substrings. CPM 2021: 9:1-9:18 - [c11]Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski:
Incomplete Directed Perfect Phylogeny in Linear Time. WADS 2021: 172-185 - 2020
- [c10]Giulia Bernardini, Huiping Chen, Gabriele Fici, Grigorios Loukides, Solon P. Pissis:
Reverse-Safe Data Structures for Text Indexing. ALENEX 2020: 199-213 - [c9]Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski:
On Two Measures of Distance Between Fully-Labelled Trees. CPM 2020: 6:1-6:16 - [c8]Giulia Bernardini, Huiping Chen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Leen Stougie, Michelle Sweering:
String Sanitization Under Edit Distance. CPM 2020: 7:1-7:14 - [c7]Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering:
Hide and Mine in Strings: Hardness and Algorithms. ICDM 2020: 924-929 - 2019
- [c6]Giulia Bernardini, Paola Bonizzoni, Gianluca Della Vedova, Murray Patterson:
A Rearrangement Distance for Fully-Labelled Trees. CPM 2019: 28:1-28:15 - [c5]Giulia Bernardini, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication. ICALP 2019: 21:1-21:15 - [c4]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
String Sanitization: A Combinatorial Approach. ECML/PKDD (1) 2019: 627-644 - 2018
- [c3]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest Property-Preserved Common Factor. SPIRE 2018: 42-49 - [c2]Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Degenerate String Comparison and Applications. WABI 2018: 21:1-21:14 - 2017
- [c1]Giulia Bernardini, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Pattern Matching on Elastic-Degenerate Text with Errors. SPIRE 2017: 74-90
Informal and Other Publications
- 2023
- [i11]Giulia Bernardini, Leo van Iersel, Esther Julien, Leen Stougie:
Constructing Phylogenetic Networks via Cherry Picking and Machine Learning. CoRR abs/2304.02729 (2023) - [i10]Rocco Ascone, Giulia Bernardini, Luca Manzoni:
Fixed Points and Attractors of Reactantless and Inhibitorless Reaction Systems. CoRR abs/2307.15612 (2023) - 2022
- [i9]Giulia Bernardini, Alexander Lindermayr, Alberto Marchetti-Spaccamela, Nicole Megow, Leen Stougie, Michelle Sweering:
A Universal Error Measure for Input Predictions Applied to Online Graph Problems. CoRR abs/2205.12850 (2022) - [i8]Giulia Bernardini, Estéban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering, Wiktor Zuba:
Elastic-Degenerate String Matching with 1 Error. CoRR abs/2209.01095 (2022) - 2020
- [i7]Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski:
On Two Measures of Distance between Fully-Labelled Trees. CoRR abs/2002.05600 (2020) - [i6]Giulia Bernardini, Gabriele Fici, Pawel Gawrychowski, Solon P. Pissis:
Substring Complexity in Sublinear Space. CoRR abs/2007.08357 (2020) - [i5]Giulia Bernardini, Paola Bonizzoni, Pawel Gawrychowski:
Incomplete Directed Perfect Phylogeny in Linear Time. CoRR abs/2010.05644 (2020) - 2019
- [i4]Giulia Bernardini, Paola Bonizzoni, Gianluca Della Vedova, Murray Patterson:
A rearrangement distance for fully-labelled trees. CoRR abs/1904.01321 (2019) - [i3]Giulia Bernardini, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication. CoRR abs/1905.02298 (2019) - [i2]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
String Sanitization: A Combinatorial Approach. CoRR abs/1906.11030 (2019) - 2018
- [i1]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest Property-Preserved Common Factor. CoRR abs/1810.02099 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 21:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
