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 [2]	Hilfe

Suche: Booktitle=Proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM'2012 (Helsinki, Finland July 3-5, 2012)

• Gene regulation, protein networks and disease: A computational perspective
  Ron Shamir
  Lecture Notes in Computer Science 7354, 2012, pp. 1-1
• Wavelet trees for all
  Gonzalo Navarro
  Lecture Notes in Computer Science 7354, 2012, pp. 2-26
• The maximum number of squares in a tree
  Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczyński, Tomasz Waleń
  Lecture Notes in Computer Science 7354, 2012, pp. 27-40
• Faster and simpler minimal conflicting set identification
  Aïda Ouangraoua, Mathieu Raffinot
  Lecture Notes in Computer Science 7354, 2012, pp. 41-55
• Partitioning into colorful components by minimum edge deletions
  Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann
  Lecture Notes in Computer Science 7354, 2012, pp. 56-69
• Approximation algorithms and hardness results for shortest path based graph orientations
  Dima Blokh, Danny Segev, Roded Sharan
  Lecture Notes in Computer Science 7354, 2012, pp. 70-82
• Constant-time word-size string matching
  Dany Breslauer, Leszek Ga̧sieniec, Roberto Grossi
  Lecture Notes in Computer Science 7354, 2012, pp. 83-96
• Pattern matching in multiple streams
  Raphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach
  Lecture Notes in Computer Science 7354, 2012, pp. 97-109
• An efficient linear pseudo-minimization algorithm for Aho-Corasick automata
  Omar AitMous, Frédérique Bassino, Cyril Nicaud
  Lecture Notes in Computer Science 7354, 2012, pp. 110-123
• Efficient two-dimensional pattern matching with scaling and rotation and higher-order interpolation
  Christian Hundt, Florian Wendland
  Lecture Notes in Computer Science 7354, 2012, pp. 124-137
• Hardness of longest common subsequence for sequences with bounded run-lengths
  Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette
  Lecture Notes in Computer Science 7354, 2012, pp. 138-148
• Near linear time construction of an approximate index for all maximum consecutive sub-sums of a sequence
  Ferdinando Cicalese, Eduardo Laber, Oren Weimann, Raphael Yuster
  Lecture Notes in Computer Science 7354, 2012, pp. 149-158
• The complexity of string partitioning
  Anne Condon, Ján Man̑uch, Chris Thachuk
  Lecture Notes in Computer Science 7354, 2012, pp. 159-172
• Towards an optimal space-and-query-time index for top-k document retrieval
  Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan
  Lecture Notes in Computer Science 7354, 2012, pp. 173-184
• Document listing for queries with excluded pattern
  Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter
  Lecture Notes in Computer Science 7354, 2012, pp. 185-195
• Cross-document pattern matching
  Gregory Kucherov, Yakov Nekrich, Tatiana Starikovskaya
  Lecture Notes in Computer Science 7354, 2012, pp. 196-207
• FEMTO: Fast search of large sequence collections
  Michael P. Ferguson
  Lecture Notes in Computer Science 7354, 2012, pp. 208-219
• Speeding up q-gram mining on grammar-based compressed texts
  Keisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda
  Lecture Notes in Computer Science 7354, 2012, pp. 220-231
• Simple and efficient LZW-compressed multiple pattern matching
  Paweƚ Gawrychowski
  Lecture Notes in Computer Science 7354, 2012, pp. 232-242
• Computing the Burrows-Wheeler transform of a string and its reverse
  Enno Ohlebusch, Timo Beller, Mohamed I. Abouelhoda
  Lecture Notes in Computer Science 7354, 2012, pp. 243-256
• Efficient algorithm for circular Burrows-Wheeler transform
  Wing-Kai Hon, Tsung-Han Ku, Chen-Hua Lu, Rahul Shah, Sharma V. Thankachan
  Lecture Notes in Computer Science 7354, 2012, pp. 257-268
• Least random suffix/prefix matches in output-sensitive time
  Niko Välimäki
  Lecture Notes in Computer Science 7354, 2012, pp. 269-279
• Compressed string dictionary look-up with edit distance one
  Djamal Belazzougui, Rossano Venturini
  Lecture Notes in Computer Science 7354, 2012, pp. 280-292
• Time-space trade-offs for longest common extensions
  Philip Bille, Inge Li Grtz, Benjamin Sach, Hjalte Wedel Vildhj
  Lecture Notes in Computer Science 7354, 2012, pp. 293-305
• Local exact pattern matching for non-fixed RNA structures
  Mika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau, Mathias Möhl, Christina Schmiedl, Sebastian Will
  Lecture Notes in Computer Science 7354, 2012, pp. 306-320