Arianna Pavone

Caterina Viola

SN Comput. Sci., October, 2024

Quantum Path Parallelism: A Circuit-Based Approach to Text Searching.

[BibT_eX]

[DOI]

Caterina Viola

Proceedings of the Theory and Applications of Models of Computation, 2024

The Great Textual Hoax: Boosting Sampled String Matching with Fake Samples.

[BibT_eX]

[DOI]

Antonino Andrea Moschetto

Antonio Scardace

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

How Much Do DNA and Protein Deep Embeddings Preserve Biological Information?

[BibT_eX]

[DOI]

Proceedings of the Computational Methods in Systems Biology, 2024

2023

Improved characters distance sampling for online and offline text searching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., February, 2023

Longest Common Substring and Longest Palindromic Substring in Õ(√n) Time.

[BibT_eX]

[DOI]

CoRR, 2023

Quantum Circuits for Fixed Substring Matching Problems.

[BibT_eX]

[DOI]

CoRR, 2023

Quantum String Matching Unfolded and Extended.

[BibT_eX]

[DOI]

Proceedings of the Reversible Computation - 15th International Conference, 2023

2022

Resolving Linguistic Ambiguities by Visual Context.

[BibT_eX]

[DOI]

SN Comput. Sci., 2022

2021

Text Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations.

[BibT_eX]

[DOI]

CoRR, 2021

How Neurons in Deep Models Relate with Neurons in the Brain.

[BibT_eX]

[DOI]

Algorithms, 2021

Towards an Efficient Text Sampling Approach for Exact and Approximate Matching.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2021, 2021

Revising Conceptual Similarity by Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the 13th International Joint Conference on Computational Intelligence, 2021

Enhancing Characters Distance Text Sampling by Condensed Alphabets.

[BibT_eX]

[DOI]

Proceedings of the 22nd Italian Conference on Theoretical Computer Science, 2021

2020

Efficient Online String Matching Based on Characters Distance Text Sampling.

[BibT_eX]

[DOI]

Algorithmica, 2020

Sequence Searching Allowing for Non-Overlapping Adjacent Unbalanced Translocations.

[BibT_eX]

[DOI]

Proceedings of the 20th International Workshop on Algorithms in Bioinformatics, 2020

Neural Semantic Pointers in Context.

[BibT_eX]

[DOI]

Proceedings of the 12th International Joint Conference on Computational Intelligence, 2020

2019

Linear and Efficient String Matching Algorithms Based on Weak Factor Recognition.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

Flexible and Efficient Algorithms for Abelian Matching in Genome Sequence.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics and Biomedical Engineering, 2019

Alignment of Sequences Allowing for Non-overlapping Unbalanced Translocations of Adjacent Factors.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics and Biomedical Engineering, 2019

2018

Flexible and Efficient Algorithms for Abelian Matching in Strings.

[BibT_eX]

[DOI]

CoRR, 2018

An Efficient Skip-Search Approach to Swap Matching.

[BibT_eX]

[DOI]

Comput. J., 2018

2017

Speeding Up String Matching by Weak Factor Recognition.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2017, 2017

2015

Prior Polarity Lexical Resources for the Italian Language.

[BibT_eX]

[DOI]

CoRR, 2015

Refined Tagging of Complex Verbal Phrases for the Italian Language.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2015, 2015

2014

Automatic Extraction of Semantic Relations by Using Web Statistical Information.

[BibT_eX]

[DOI]

Valeria Borzì