Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=8486

• On the efficiency of the Hamming C-centerstring problems
  Amihood Amir, Jessica Ficler, Liam Roditty, Oren Sar Shalom
  Lecture Notes in Computer Science 8486, 2014, pp. 1-10
• Dictionary matching with one gap
  Amihood Amir, Avivit Levy, Ely Porat, B. Riva Shalom
  Lecture Notes in Computer Science 8486, 2014, pp. 11-20
• Approximate on-line palindrome recognition, and applications
  Amihood Amir, Benny Porat
  Lecture Notes in Computer Science 8486, 2014, pp. 21-29
• Computing minimal and maximal suffixes of a substring revisited
  Maxim Babenko, Paweƚ Gawrychowski, Tomasz Kociumaka, Tatiana Starikovskaya
  Lecture Notes in Computer Science 8486, 2014, pp. 30-39
• Compressed subsequence matching and packed tree coloring
  Philip Bille, Patrick Hagge Cording, Inge Li Grtz
  Lecture Notes in Computer Science 8486, 2014, pp. 40-49
• Reversal distances for strings with few blocks or small alphabets
  Laurent Bulteau, Guillaume Fertin, Christian Komusiewicz
  Lecture Notes in Computer Science 8486, 2014, pp. 50-59
• On combinatorial generation of prefix normal words
  Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada
  Lecture Notes in Computer Science 8486, 2014, pp. 60-69
• Permuted scaled matching
  Ayelet Butman, Noa Lewenstein, J. Ian Munro
  Lecture Notes in Computer Science 8486, 2014, pp. 70-78
• The worst case complexity of maximum parsimony
  Amir Carmel, Noa Musa-Lempel, Dekel Tsur, Michal Ziv-Ukelson
  Lecture Notes in Computer Science 8486, 2014, pp. 79-88
• From indexing data structures to de Bruijn graphs
  Bastien Cazaux, Thierry Lecroq, Eric Rivals
  Lecture Notes in Computer Science 8486, 2014, pp. 89-99
• Randomized and parameterized algorithms for the closest string problem
  Zhi-Zhong Chen, Bin Ma, Lusheng Wang
  Lecture Notes in Computer Science 8486, 2014, pp. 100-109
• Indexed geometric jumbled pattern matching
  Stephane Durocher, Robert Fraser, Travis Gagie, Debajyoti Mondal, Matthew Skala, Sharma V. Thankachan
  Lecture Notes in Computer Science 8486, 2014, pp. 110-119
• An improved query time for succinct dynamic dictionary matching
  Guy Feigenblat, Ely Porat, Ariel Shiftan
  Lecture Notes in Computer Science 8486, 2014, pp. 120-129
• Order-preserving pattern matching with k mismatches
  Paweƚ Gawrychowski, Przemysƚaw Uznański
  Lecture Notes in Computer Science 8486, 2014, pp. 130-139
• Parameterized complexity analysis for the closest string with wildcards problem
  Danny Hermelin, Liat Rozenberg
  Lecture Notes in Computer Science 8486, 2014, pp. 140-149
• Computing palindromic factorizations and palindromic covers on-line
  Tomohiro I, Shiho Sugimoto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
  Lecture Notes in Computer Science 8486, 2014, pp. 150-161
• Compactness-preserving mapping on trees
  Jan Baumbach, Jiong Guo, Rashid Ibragimov
  Lecture Notes in Computer Science 8486, 2014, pp. 162-171
• Shortest unique substring query revisited
  Atalay Mert İleri, M. Og̑uzhan Külekci, Bojian Xu
  Lecture Notes in Computer Science 8486, 2014, pp. 172-181
• A really simple approximation of smallest grammar
  Artur Jeż
  Lecture Notes in Computer Science 8486, 2014, pp. 182-191
• Efficient algorithms for shortest partial seeds in words
  Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń
  Lecture Notes in Computer Science 8486, 2014, pp. 192-201
• Computing k-th Lyndon word and decoding lexicographically minimal de Bruijn sequence
  Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter
  Lecture Notes in Computer Science 8486, 2014, pp. 202-211
• Searching of gapped repeats and subrepetitions in a word
  Roman Kolpakov, Mikhail Podolskiy, Mikhail Posypkin, Nickolay Khrapov
  Lecture Notes in Computer Science 8486, 2014, pp. 212-221
• Approximate string matching using a bidirectional index
  Gregory Kucherov, Kamil Salikhov, Dekel Tsur
  Lecture Notes in Computer Science 8486, 2014, pp. 222-231
• String range matching
  Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
  Lecture Notes in Computer Science 8486, 2014, pp. 232-241
• On hardness of several string indexing problems
  Kasper Green Larsen, J. Ian Munro, Jesper Sindahl Nielsen, Sharma V. Thankachan
  Lecture Notes in Computer Science 8486, 2014, pp. 242-251