„string matching“

Suchergebnisse

1.000+ Treffer

• Linear Time Construction of Indexable Founder Block Graphs
  Mäkinen, Veli ; Cazaux, Bastien ; Equi, Massimo ; Norri, Tuukka ; Tomescu, Alexandru I. 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Combinatorial Pattern Matching – 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005. Proceedings
  Giancarlo, Raffaele ; Manzini, Giovanni 2005 Springer Berlin Heidelberg
• Matching renormalisable couplings: simple schemes and a plot
  Braathen, Johannes ; Goodsell, Mark D. ; Slavich, Pietro
• (Mis-)matching type-B anomalies on the Higgs branch
  Niarchos, Basilēs ; Papageorgakis, Constantinos ; Pini, Alessandro ; Pomoni, Elli
• The Rational Construction of a Wheeler DFA
  Manzini, Giovanni ; Policriti, Alberto ; Prezza, Nicola ; Riccardi, Brian 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Using Automata and a Decision Procedure to Prove Results in Pattern Matching (Invited Talk)
  Shallit, Jeffrey O. 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• BFM: a forward backward string matching algorithm with improved shifting for information retrieval
  Al-Faruk, MD. Obaidullah ; Hussain, K. M. Akib ; Shahriar, MD. Adnan ; Tonni, Shakila Mahjabin
• An improved pattern matching algorithm for strings with short descriptions
  Karpiński, Marek ; Rytter, Wojciech ; Shinohara, Ayumi 1995 Inst. für Informatik
• Constant-space string matching with smaller number of comparisons – sequential sampling
  Gąsieniec, Leszek ; Plandowski, Wojciech ; Rytter, Wojciech 1995 Inst. für Informatik
• The fully compressed string matching for Lempel-Ziv encoding
  Karpiński, Marek ; Plandowski, Wojciech ; Rytter, Wojciech 1995 Inst. für Informatik
• Approximate String Matching – Improving Data Structures and Algorithms
  Pockrandt, Christopher Maximilian 2019 Freie Universität Berlin
• Noise robust open vocabulary information retrieval in large spoken document collection
  Jin, Shan ; Sikora, Thomas ; Kolossa, Dorothea ; Keller, Ivo 2015 Technische Universität Berlin
• Approximate string matching for high-throughput sequencing
  Siragusa, Enrico 2015 Freie Universität Berlin
• Matching the heterotic string on orbifolds and their resolutions
  Cabo Bizet, Nana Geraldine 2013 Universitäts- und Landesbibliothek Bonn
• Über die Vermeidung redundanter Betrachtungen beim Approximate String Matching
  Richter, Christoph Jan 2005 Universitätsbibliothek Technische Universität Dortmund
• Abelian pattern matching in strings
  Ejaz, Tahir
• Filter algorithms for approximate string matching
  Burkhardt, Stefan
• Algorithms and Complexity – 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings
  Spirakis, Paul G. ; Serna, Maria 2013 Springer Berlin Heidelberg
• Combinatorial Pattern Matching – 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings
  Kärkkäinen, Juha ; Stoye, Jens 2012 Springer Berlin Heidelberg
• Experimental Algorithms – 11th International Symposium, SEA 2012, Bordeaux, France, June 7-9, 2012. Proceedings
  Klasing, Ralf 2012 Springer Berlin Heidelberg