„string algorithms“

Suchergebnisse

261 Treffer

• Data structures and algorithms for the string statistics problem
  Apostolico, A. ; Preparata, F. P.
• Approximate string matching with suffix automata
  Ukkonen, Esko ; Wood, Derick
• Algorithms for Matching Strings with Fuzzy Context-Free and Automata Patterns
  Kostanyan, A. H.
• Finding all periods and initial palindromes of a string in parallel
  Breslauer, D. ; Galil, Z.
• A comparison of optimisation algorithms for high-dimensional particle and astrophysics applications
  Balázs, Csaba ; Beekveld, Melissa van ; Caron, Sascha ; Dillon, Barry M. ; Farmer, Ben ; Fowlie, Andrew ; Garrido-Merchán, Eduardo C. ; Handley, Will ; Hendriks, Luc ; Jóhannesson, Guðlaugur ; Leinweber, Adam ; Mamužić, Judita ; Martinez, Gregory D. ; Otten, Sydney ; Austri, Roberto Ruiz de ; Scott, Pat ; Searle, Zachary ; Stienen, Bob ; Vanschoren, Joaquin ; White, Martin
• Readjoiner: a fast and memory efficient string graph-based sequence assembler
  Gonnella, Giorgio ; Kurtz, Stefan
• Sublinear approximate string matching and biological applications
  Chang, W. I. ; Lawler, E. L.
• Speeding up two string-matching algorithms
  Crochemore, M. ; Czumaj, A. ; Gasieniec, L. ; Jarominek, S. ; Lecroq, T. ; Plandowski, W. ; Rytter, W.
• Guest editor's foreword special issue on string algorithmics and its applications
  Apostolico, Alberto
• String layouts for a redundant array of inexpensive disks
  Newberg, L. ; Wolfe, D.
• Squares, cubes, and time-space efficient string searching
  Crochemore, M. ; Rytter, W.
• Combinatorial properties of periodic patterns in compressed strings
  Pape-Lange, Julian 2023 Universitätsverlag Chemnitz
• Evolutionary Algorithms for Multi‐Center Solutions
  Rawash, Sami ; Turton, David
• Data Structures for Computing Unique Palindromes in Static and Non-Static Strings
  Mieno, Takuya ; Funakoshi, Mitsuru
• Near-Optimal Quantum Algorithms for String Problems
  Akmal, Shyan ; Jin, Ce
• Bounds on algorithms for string generation
  McKellar, A. C. ; Wong, C. K.
• Bit-Parallel Witnesses and Their Applications to Approximate String Matching
  Hyyrö, Heikki ; Navarro, Gonzalo
• Approximate Matching of Run-Length Compressed Strings
  Mäkinen ; Ukkonen ; Navarro
• Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems
  Le Gall, François ; Seddighin, Saeed
• Combinatoric topological string theories and group theory algorithms
  Ramgoolam, Sanjaye ; Sharpe, Eric