( en | de | ru )

 

Disambiguation of "Faro, Simone"

Author of the publication

copydeleteadd this publication to your clipboard
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms.

, and . SEA, volume 7276 of Lecture Notes in Computer Science, page 172-183. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mahfuza Farooque

Ayaz Farooq

An evaluation framework for software test processes. Uni Magdeburg, (2009)

Suraiya Faroqhi

Hans-Berndt Farohs

Mohammad-Seid Farokhfar

 

Other publications of authors with the same name

Prior Polarity Lexical Resources for the Italian Language., , , and . CoRR, (2015)Efficient Algorithms for the Order Preserving Pattern Matching Problem., and . CoRR, (2015)Efficient Variants of the Backward-Oracle-Matching Algorithm., and . Int. J. Found. Comput. Sci., 20 (6): 967-984 (2009)Enhancing Characters Distance Text Sampling by Condensed Alphabets., , and . ICTCS, volume 3072 of CEUR Workshop Proceedings, page 1-15. CEUR-WS.org, (2021)Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences., , and . Stringology, page 33-47. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2004)Speeding Up String Matching by Weak Factor Recognition., , and . Stringology, page 42-50. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2017)New Efficient Bit-Parallel Algorithms for the delta-Matching Problem with alpha-Bounded Gaps in Musical Sequences., , and . Stringology, page 170184. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2008)Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton., and . CIAA, volume 12803 of Lecture Notes in Computer Science, page 165-177. Springer, (2021)Flexible and Efficient Algorithms for Abelian Matching in Genome Sequence., and . IWBBIO (1), volume 11465 of Lecture Notes in Computer Science, page 307-318. Springer, (2019)Fast-Insertion-Sort: a New Family of Efficient Variants of the Insertion-Sort Algorithm., , and . SOFSEM (Doctoral Student Research Forum), volume 2568 of CEUR Workshop Proceedings, page 37-48. CEUR-WS.org, (2020)