„string algorithms“

Suchergebnisse

261 Treffer

• Bit Packed Encodings for Grammar-Compressed Strings Supporting Fast Random Access
  Cleary, Alan M. ; Winjum, Joseph ; Dood, Jordan ; Shibata, Hiroki ; Inenaga, Shunsuke 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Methods and Applications of Algorithmic Complexity – Beyond Statistical Lossless Compression
  Zenil, Hector ; Soler Toscano, Fernando ; Gauvrit, Nicolas 2022 Springer Berlin Heidelberg
• Convergence of the Number of Period sets in Strings
  Rivals, Eric ; Sweering, Michelle ; Wang, Pengfei
• An 11/6-Approximation Algorithm for Vertex Cover on String Graphs
  Bonnet, Édouard ; Rzążewski, Paweł 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Improved Approximation Algorithms for Dyck Edit Distance and RNA Folding
  Das, Debarati ; Kociumaka, Tomasz ; Saha, Barna 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximating Longest Common Substring with k mismatches: Theory and Practice
  Gourdel, Garance ; Kociumaka, Tomasz ; Radoszewski, Jakub ; Starikovskaya, Tatiana 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Internal Dictionary Matching
  Charalampopoulos, Panagiotis ; Kociumaka, Tomasz ; Mohamed, Manal ; Radoszewski, Jakub ; Rytter, Wojciech ; Waleń, Tomasz 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• RLE Edit Distance in Near Optimal Time
  Clifford, Raphaël ; Gawrychowski, Paweł ; Kociumaka, Tomasz ; Martin, Daniel P. ; Uznański, Przemysław 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number (Track B: Automata, Logic, Semantics, and Theory of Programming)
  Casel, Katrin ; Day, Joel ; Fleischmann, Pamela ; Kociumaka, Tomasz ; Manea, Florin ; Schmid, Markus L. 2019 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• String Powers in Trees
  Kociumaka, Tomasz ; Radoszewski, Jakub ; Rytter, Wojciech ; Waleń, Tomasz
• $$\textsc {McDag}$$ M C D A G : indexing maximal common subsequences for k strings
  Buzzega, Giovanni ; Conte, Alessio ; Grossi, Roberto ; Punzi, Giulia
• Optimized process quality in certified breast centers through adherence to stringent diagnostic and therapeutic algorithms effects of structural as well as socio-demographic factors on start of therapy
  Herbert, Saskia-Laureen ; Hirzle, Paula ; Bartmann, Catharina ; Schlaiß, Tanja ; Kiesel, Matthias ; Curtaz, Carolin ; Löb, Sanja ; Wöckel, Achim ; Diessner, Joachim 2024 Universität Würzburg
• Exploiting physico-chemical properties in string kernels
  Toussaint, Nora C. ; Widmer, Christian ; Kohlbacher, Oliver ; Rätsch, Gunnar
• Crochemore’s Partitioning on Weighted Strings and Applications
  Barton, Carl ; Pissis, Solon P.
• Identifying a few foot-and-mouth disease virus signature nucleotide strings for computational genotyping
  Lin, Guohui ; Cai, Zhipeng ; Wu, Junfeng ; Wan, Xiu-Feng ; Xu, Lizhe ; Goebel, Randy
• Minimal Generators in Optimal Time
  Ellert, Jonas ; Gawrychowski, Paweł ; Starikovskaya, Tatiana 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Linear-Space LCS Enumeration for Two Strings
  Sakai, Yoshifumi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Representing Paths in Digraphs
  Dondi, Riccardo ; Popa, Alexandru 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line
  Pissis, Solon P. ; Retha, Ahmad 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Algorithms and tools for iterated Eisenstein integrals
  Duhr, Claude ; Tancredi, Lorenzo