• Refine your search:
  • 
    Keyword
  • 
    Creator / Publisher:
    
    • The Pennsylvania State University CiteSeerX Archives (75)
    • Marie-france Sagot (11)
    • Julien Allali (10)
    • Maxime Crochemore (9)
    • Pierre Peterlongo (8)
    • Frantisek Franek (4)
    • Hutter, Marcus (4)
    • Ng, Kee Siong (4)
    • Puglisi, Simon J. (4)
    • Shah, Rahul (4)
    •   more
  • 
    Year
  • 
    Medium:
    
    • Online (132)
  • 
    Type:
    
    • Article (118)
    • Book (11)
    • Miscellaneous (3)
  • 
    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 132 1 A Review on Planted (l, d) Motif Discovery Algorithms for Medical Diagnose Satarupa Mohanty; Prasant Kumar Pattnaik; Ahmed Abdulhakim Al-Absi; Dae-Ki Kang In: Sensors; Volume 22; Issue 3; Pages: 1204 (2022) BASE Show details 2 A Compact Index for Cartesian Tree Matching ... Kim, Sung-Hwan; Cho, Hwan-Gue. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 3 Weighted Ancestors in Suffix Trees Revisited ... Belazzougui, Djamal; Kosolobov, Dmitry; Puglisi, Simon J.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 4 The k-Mappability Problem Revisited ... Amir, Amihood; Boneh, Itai; Kondratovsky, Eitan. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 5 Efficient Algorithms for Counting Gapped Palindromes ... Popa, Andrei; Popa, Alexandru. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021 BASE Show details 6 Accurate Cardinality Estimation of Co-occurring Words Using Suffix Trees (Extended Version) ... Willkomm, Jens; Schäler, Martin; Böhm, Klemens. - : Karlsruher Institut für Technologie (KIT), 2021 BASE Show details 7 Accurate Cardinality Estimation of Co-occurring Words Using Suffix Trees (Extended Version) Willkomm, Jens; Schäler, Martin; Böhm, Klemens. - : Karlsruher Institut für Technologie, 2021 BASE Show details 8 Pattern Discovery in Colored Strings Puglisi, Simon J.; Rossi, Massimiliano. - : LIPIcs - Leibniz International Proceedings in Informatics. 18th International Symposium on Experimental Algorithms (SEA 2020), 2020 BASE Show details 9 Indexing Isodirectional Pointer Sequences ... Kim, Sung-Hwan; Cho, Hwan-Gue. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 10 Parallel text index construction ... Kurpicz, Florian. - : Technische Universität Dortmund, 2020 BASE Show details 11 Pattern Discovery in Colored Strings ... Lipták, Zsuzsanna; Puglisi, Simon J.; Rossi, Massimiliano. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020 BASE Show details 12 Detecting Pattern Anomalies in Hydrological Time Series with Weighted Probabilistic Suffix Trees Yufeng Yu; Dingsheng Wan; Qun Zhao... In: Water ; Volume 12 ; Issue 5 (2020) BASE Show details 13 Parallel text index construction Kurpicz, Florian. - 2020 BASE Show details 14 Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs Belazzougui, Djamal; Cunial, Fabio. - : 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 15 Searching Long Repeats in Streams Merkurev, Oleg; Shur, Arseny M.. - : 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 16 Method for Generalization of Fuzzy Sets Frolov, Dmitry; Mirkin, Boris; Nascimento, Susana. - : Springer, 2019 BASE Show details 17 Editorial: Special Issue on Efficient Data Structures Jesper Jansson In: Algorithms ; Volume 12 ; Issue 7 (2019) BASE Show details 18 Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms Amir, Amihood; Boneh, Itai. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. : LIPIcs - Leibniz International Proceedings in Informatics. Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018 BASE Show details 19 Sliding Suffix Tree Andrej Brodnik; Matevž Jekovec In: Algorithms ; Volume 11 ; Issue 8 (2018) BASE Show details 20 Full Compressed Affix Tree Representations Cánovas, Rodrigo; Rivals, Eric In: IEEE Data Compression Conference ; DCC: Data Compression Conference ; https://hal-lirmm.ccsd.cnrs.fr/lirmm-02093302 ; DCC: Data Compression Conference, IEEE, Apr 2017, Snowbird, UT, United States. pp.102-111, ⟨10.1109/DCC.2017.39⟩ ; http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7921793 (2017) 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) 0 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 132 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0