Simone Faro

Stefano Scafiti

Proceedings of the SOFSEM 2020 Doctoral Student Research Forum co-located with the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), 2020

Shape-Preserving Pattern Matching.

[BibT_eX]

[DOI]

Proceedings of the 21st Italian Conference on Theoretical Computer Science, 2020

2019

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

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2019

Fast Cartesian Tree Matching.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 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

Verifiable pattern matching on outsourced texts.

[BibT_eX]

[DOI]

Dario Catalano

Mario Di Raimondo

J. Discrete Algorithms, 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

Engineering order-preserving pattern matching with SIMD parallelism.

[BibT_eX]

[DOI]

Softw. Pract. Exp., 2017

Speeding Up String Matching by Weak Factor Recognition.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2017, 2017

2016

Exact Online String Matching Bibliography.

[BibT_eX]

[DOI]

CoRR, 2016

The String Matching Algorithms Research Tool.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2016, 2016

Evaluation and Improvement of Fast Algorithms for Exact Matching on Genome Sequences.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Computational Biology - Third International Conference, 2016

Efficient Algorithms for the Order Preserving Pattern Matching Problem.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2016

A Very Fast String Matching Algorithm Based on Condensed Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2016

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

An Efficient Skip-Search Approach to the Order-Preserving Pattern Matching Problem.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2015, 2015

Nucleotide Sequence Alignment and Compression via Shortest Unique Substring.

[BibT_eX]

[DOI]

Boran Adas

Ersin Bayraktar

Ibraheem Elsayed Moustafa

Proceedings of the Bioinformatics and Biomedical Engineering, 2015

2014

Fast and flexible packed string matching.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Improved and self-tuned occurrence heuristics.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Text searching allowing for inversions and translocations of factors.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Efficient Online Abelian Pattern Matching in Strings by Simulating Reactive Multi-Automata.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2014, Prague, Czech Republic, 2014

Automatic Extraction of Semantic Relations by Using Web Statistical Information.

[BibT_eX]

[DOI]

Valeria Borzì

Proceedings of the Graph-Based Representation and Reasoning, 2014

2013

Efficient string-matching allowing for non-overlapping inversions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

The exact online string matching problem: A review of the most recent results.

[BibT_eX]

[DOI]

ACM Comput. Surv., 2013

Towards a Very Fast Multiple String Matching Algorithm for Short Patterns.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Swap Matching in Strings by Simulating Reactive Automata.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Fast Packed String Matching for Short Patterns.

[BibT_eX]

[DOI]

Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, 2013

2012

On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Adapting Boyer-Moore-like Algorithms for Searching Huffman Encoded Texts.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Pattern Matching with Swaps in Practice.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

A compact representation of nondeterministic (suffix) automata for the bit-parallel approach.

[BibT_eX]

[DOI]

Inf. Comput., 2012

A Fast Suffix Automata Based Algorithm for Exact Online String Matching.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2012

A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms - 11th International Symposium, 2012

Fast Multiple String Matching Using Streaming SIMD Extensions Technology.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2012

Fast searching in biological sequences using multiple hash functions.

[BibT_eX]

[DOI]

Proceedings of the 12th IEEE International Conference on Bioinformatics & Bioengineering, 2012

2011

String matching with inversions and translocations in linear average time (most of the time).

[BibT_eX]

[DOI]

Szymon Grabowski

Inf. Process. Lett., 2011

2001-2010: Ten Years of Exact String Matching Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2011, 2011

Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

2010

The Exact String Matching Problem: a Comprehensive Experimental Evaluation

[BibT_eX]

[DOI]

CoRR, 2010

On Tuning the Bad-Character Rule: the Worst-Character Rule

[BibT_eX]

[DOI]

CoRR, 2010

Approximate String Matching Allowing for Inversions and Translocations.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

A Space-Efficient Implementation of the Good-Suffix Heuristic.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2010, Prague, Czech Republic, August 30, 2010

Ant-CSP: An Ant Colony Optimization Algorithm for the Closest String Problem.

[BibT_eX]

[DOI]

Elisa Pappalardo

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Bit-(Parallelism)<sup>2</sup>: Getting to the Next Level of Parallelism.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms, 5th International Conference, 2010

2009

Efficient Variants of the Backward-Oracle-Matching Algorithm.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

New Efficient Bit-Parallel Algorithms for the (delta, alpha)-Matching Problem with Applications in Music Information Retrieval.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

An Efficient Algorithm for Approximate Pattern Matching with Swaps.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2009, Prague, Czech Republic, August 31, 2009

Pattern Matching with Swaps for Short Patterns in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

A New Algorithm for Efficient Pattern Matching with Swaps.

[BibT_eX]

[DOI]

Matteo Campanelli

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008

On Some Combinatorial Problems Concerning the Harmonic Structure of Musical Chord Sequences.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

Efficient Pattern Matching on Binary Strings

[BibT_eX]

[DOI]

CoRR, 2008

New Efficient Bit-Parallel Algorithms for the delta-Matching Problem with alpha-Bounded Gaps in Musical Sequences.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2008, Prague, Czech Republic, 2008

Finite State Models for the Generation of Large Corpora of Natural Language Texts.

[BibT_eX]

[DOI]

Proceedings of the Finite-State Methods and Natural Language Processing, 2008

2006

A Space Efficient Bit-parallel Algorithm for the Multiple String Matching Problem.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

2005

Fast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2005

An Efficient Algorithm for alpha-Approximate Matching with <i>delta</i>-Bounded Gaps in Musical Sequences.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Solving the (\delta, \alpha)-Approximate Matching Problem Under Transposition Invariance in Musical Sequences.

[BibT_eX]

[DOI]

Proceedings of the ISMIR 2005, 2005

On Tuning the (\delta, \alpha)-Sequential-Sampling Algorithm for \delta-Approximate Matching with Alpha-Bounded Gaps in Musical Sequences.

[BibT_eX]

[DOI]

Proceedings of the ISMIR 2005, 2005

2004

Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2004, Prague, Czech Republic, August 30, 2004

Two-Levels-Greedy: A Generalized of Dijkstra's Shortest Path Algorithm.

[BibT_eX]

Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2003

Fast-Search: A New Efficient Variant of the Boyer-Moore String Matching Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Experimental and Efficient Algorithms, Second International Workshop, 2003

Forward-Fast-Search: Another Fast Variant of the Boyer-Moore String Matching Algorithm.

[BibT_eX]

[DOI]