( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms.

, и . SEA, том 7276 из Lecture Notes in Computer Science, стр. 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.

Mahfuza Farooque

Ayaz Farooq

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

Suraiya Faroqhi

Hans-Berndt Farohs

Muddassar Farooq

 

Другие публикации лиц с тем же именем

Efficient Algorithms for the Order Preserving Pattern Matching Problem., и . CoRR, (2015)Prior Polarity Lexical Resources for the Italian Language., , , и . CoRR, (2015)Efficient Variants of the Backward-Oracle-Matching Algorithm., и . Int. J. Found. Comput. Sci., 20 (6): 967-984 (2009)Enhancing Characters Distance Text Sampling by Condensed Alphabets., , и . ICTCS, том 3072 из CEUR Workshop Proceedings, стр. 1-15. CEUR-WS.org, (2021)On the Longest Common Cartesian Substring Problem., , , и . Comput. J., 66 (4): 907-923 (апреля 2023)Efficient Algorithms for the delta-Approximate String Matching Problem in Musical Sequences., , и . Stringology, стр. 33-47. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2004)New Efficient Bit-Parallel Algorithms for the delta-Matching Problem with alpha-Bounded Gaps in Musical Sequences., , и . Stringology, стр. 170184. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, (2008)Speeding Up String Matching by Weak Factor Recognition., , и . Stringology, стр. 42-50. Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, (2017)Efficient String Matching Based on a Two-Step Simulation of the Suffix Automaton., и . CIAA, том 12803 из Lecture Notes in Computer Science, стр. 165-177. Springer, (2021)Fast-Insertion-Sort: a New Family of Efficient Variants of the Insertion-Sort Algorithm., , и . SOFSEM (Doctoral Student Research Forum), том 2568 из CEUR Workshop Proceedings, стр. 37-48. CEUR-WS.org, (2020)