• Refine your search:
  • 
    Keyword:
    
    • pattern matching (53)
    • Pattern matching (20)
    • Pattern Matching (13)
    • Theory of computation → Pattern matching (12)
    • suffix tree (12)
    • Data processing Computer science (10)
    • morphologic analysis (10)
    • [INFO.INFO-DS]Computer Science [cs] / Data Structures and Algorithms [cs.DS] (9)
    • natural language processing (9)
    • Linguistics (8)
    •   more
  • 
    Creator / Publisher
  • 
    Year
  • 
    Medium
  • 
    Type:
    
    • Article (111)
    • Book (15)
    • Miscellaneous (14)
  • 
    BLLDB-Access

Search in the Catalogues and Directories

All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year AND OR AND NOT All fields Title Creator / Publisher Keyword Year Sort by creator [A → Z]' creator [Z → A]' publishing year ↑ (asc)' publishing year ↓ (desc)' title [A → Z]' title [Z → A]' Simple Search Page: 1 2 3 4 5...7 Hits 1 – 20 of 140 1 Study of non-projective dependencies in French ; Étude des dépendances syntaxiques non projectives en français Perrier, Guy In: ISSN: 1248-9433 ; EISSN: 1965-0906 ; Revue TAL ; https://hal.inria.fr/hal-03389157 ; Revue TAL, ATALA (Association pour le Traitement Automatique des Langues), 2021, 62 (1) (2021) BASE Show details 2 Faster Algorithms for Longest Common Substring ... Charalampopoulos, Panagiotis; Kociumaka, Tomasz; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 3 A Compact Index for Cartesian Tree Matching ... Kim, Sung-Hwan; Cho, Hwan-Gue. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 4 Weighted Ancestors in Suffix Trees Revisited ... Belazzougui, Djamal; Kosolobov, Dmitry; Puglisi, Simon J.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 5 Constructing Strings Avoiding Forbidden Substrings ... Bernardini, Giulia; Marchetti-Spaccamela, Alberto; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 6 The k-Mappability Problem Revisited ... Amir, Amihood; Boneh, Itai; Kondratovsky, Eitan. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 7 Inverse Suffix Array Queries for 2-Dimensional Pattern Matching in Near-Compact Space ... Patel, Dhrumil; Shah, Rahul. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 8 Efficient Algorithms for Counting Gapped Palindromes ... Popa, Andrei; Popa, Alexandru. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 9 Bidirectional String Anchors: A New String Sampling Mechanism ... Loukides, Grigorios; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 10 String Indexing with Compressed Patterns Bille, Philip; Steiner, Teresa Anna. - : LIPIcs - Leibniz International Proceedings in Informatics. 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), 2020 BASE Show details 11 Indexing Isodirectional Pointer Sequences ... Kim, Sung-Hwan; Cho, Hwan-Gue. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 12 Update Query Time Trade-Off for Dynamic Suffix Arrays ... Amir, Amihood; Boneh, Itai. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 13 String Indexing with Compressed Patterns ... Bille, Philip; Gørtz, Inge Li; Steiner, Teresa Anna. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 14 Practical Performance of Space Efficient Data Structures for Longest Common Extensions ... Dinklage, Patrick; Fischer, Johannes; Herlez, Alexander. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 15 Efficient Computation of 2-Covers of a String ... Radoszewski, Jakub; Straszyński, Juliusz. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 16 Research on Uyghur Pattern Matching Based on Syllable Features Abliz; Maimaiti; Wu... In: Information ; Volume 11 ; Issue 5 (2020) BASE Show details 17 Absent words in a sliding window with applications Crochemore, Maxime; Héliou, Alice; Kucherov, Gregory... In: ISSN: 0890-5401 ; EISSN: 1090-2651 ; Information and Computation ; https://hal.archives-ouvertes.fr/hal-02414839 ; Information and Computation, Elsevier, 2019, pp.104461. ⟨10.1016/j.ic.2019.104461⟩ (2019) BASE Show details 18 Designing Language-Agnostic Code Transformation Engines ; Construction de moteurs de transformation de code automatique agnostiques du langage Lecerf, Jason. - : HAL CCSD, 2019 In: https://tel.archives-ouvertes.fr/tel-03356307 ; Programming Languages [cs.PL]. Université de Lille, 2019. English (2019) BASE Show details 19 CLIN26-Bracmat-poster.pdf ... Jongejan, Bart. - : https://b2share.eudat.eu, 2019 BASE Show details 20 Online Algorithms for Constructing Linear-Size Suffix Trie Hendrian, Diptarama; Takagi, Takuya; Inenaga, Shunsuke. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 2019 BASE Show details Page: 1 2 3 4 5...7

Mobile view All Catalogues UB Frankfurt Linguistik 0 IDS Mannheim 0 OLC Linguistik 0 UB Frankfurt Retrokatalog 0 DNB Subject Category Language 0 Institut für Empirische Sprachwissenschaft 0 Leibniz-Centre General Linguistics (ZAS) 1 Bibliographies BLLDB 0 BDSL 0 IDS Bibliografie zur deutschen Grammatik 0 IDS Bibliografie zur Gesprächsforschung 0 IDS Konnektoren im Deutschen 0 IDS Präpositionen im Deutschen 0 IDS OBELEX meta 0 MPI-SHH Linguistics Collection 0 MPI for Psycholinguistics 0 Linked Open Data catalogues Annohub 0 Online resources Link directory 0 Journal directory 0 Database directory 0 Dictionary directory 0 Open access documents BASE 139 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0