„Graph 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
• The Rational Construction of a Wheeler DFA
  Manzini, Giovanni ; Policriti, Alberto ; Prezza, Nicola ; Riccardi, Brian 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• 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 – 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings
  2011 Springer Berlin Heidelberg
• Combinatorial Algorithms – 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers
  Iliopoulos, Costas S. ; Smyth, William F. 2011 Springer Berlin Heidelberg
• Conditional Lower Bounds for String Matching in Labelled Graphs
  Equi, Massimo 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Graph Indexing Beyond Wheeler Graphs
  Alanko, Jarno N. ; Biagi, Elena ; Equi, Massimo ; Mäkinen, Veli ; Puglisi, Simon J. ; Rizzo, Nicola ; Sadakane, Kunihiko ; Sirén, Jouni 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Representing Paths in Digraphs
  Dondi, Riccardo ; Popa, Alexandru 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On the Complexity of String Matching for Graphs
  Equi, Massimo ; Grossi, Roberto ; Mäkinen, Veli ; Tomescu, Alexandru I. 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A Unifying Taxonomy of Pattern Matching in Degenerate Strings and Founder Graphs
  Ascone, Rocco ; Bernardini, Giulia ; Conte, Alessio ; Equi, Massimo ; Gabory, Esteban ; Grossi, Roberto ; Pisanti, Nadia 2024 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Faster Prefix-Sorting Algorithms for Deterministic Finite Automata
  Kim, Sung-Hwan ; Olivares, Francisco ; Prezza, Nicola 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• From Bit-Parallelism to Quantum String Matching for Labelled Graphs
  Equi, Massimo ; Meijer-van de Griend, Arianne ; Mäkinen, Veli 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized Algorithms for String Matching to DAGs: Funnels and Beyond
  Cáceres, Manuel 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An Invertible Transform for Efficient String Matching in Labeled Digraphs
  Nellore, Abhinav ; Nguyen, Austin ; Thompson, Reid F. 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• String Processing and Information Retrieval – 21st International Symposium, SPIRE 2014, Ouro Preto, Brazil, October 20-22, 2014. Proceedings
  2014 Springer International Publishing
• Combinatorial pattern matching – 22nd annual symposium ; proceedings
  Giancarlo, Raffaele ; Manzini, Giovanni 2011 Springer
• Backward Pattern Matching on Elastic-Degenerate Strings
  Procházka, Petr ; Cvacho, Ondřej ; Krčál, Luboš ; Holub, Jan
• On the Multiple Pattern String Matching in DNA Databases
  Chen, Yangjun ; Chen, Bobin ; Wu, Yujia
• Microtechnology for Cell Manipulation and Sorting
  Lee, Wonhee ; Tseng, Peter ; Di Carlo, Dino 2017 Springer International Publishing