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=5577

• CPM's 20th anniversary: A statistical retrospective
  Elena Yavorska Harris, Thierry Lecroq, Gregory Kucherov, Stefano Lonardi
  Lecture Notes in Computer Science 5577, 2009, pp. 1-11
• Quasi-distinct parsing and optimal compression methods
  Amihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko
  Lecture Notes in Computer Science 5577, 2009, pp. 12-25
• Generalized substring compression
  Orgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein
  Lecture Notes in Computer Science 5577, 2009, pp. 26-38
• Text indexing, suffix sorting, and data compression: Common problems and techniques
  Roberto Grossi
  Lecture Notes in Computer Science 5577, 2009, pp. 39-40
• Contracted suffix trees: A simple and dynamic text indexing data structure
  Andrzej Ehrenfeucht, Ross McConnell, Sung-Whan Woo
  Lecture Notes in Computer Science 5577, 2009, pp. 41-53
• Linear time suffix array construction using D-Critical Substrings
  Ge Nong, Sen Zhang, Wai Hong Chan
  Lecture Notes in Computer Science 5577, 2009, pp. 54-67
• On the value of multiple read/write streams for data compression
  Travis Gagie
  Lecture Notes in Computer Science 5577, 2009, pp. 68-77
• Reoptimization of the shortest common superstring problem
  Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic̑, Tobias Mömke, Sebastian Seibert, Anna Zych
  Lecture Notes in Computer Science 5577, 2009, pp. 78-91
• LCS approximation via embedding into local non-repetitive strings
  Gad M. Landau, Avivit Levy, Ilan Newman
  Lecture Notes in Computer Science 5577, 2009, pp. 92-105
• An efficient matching algorithm for encoded DNA sequences and binary strings
  Simone Faro, Thierry Lecroq
  Lecture Notes in Computer Science 5577, 2009, pp. 106-115
• Fast searching in packed strings
  Philip Bille
  Lecture Notes in Computer Science 5577, 2009, pp. 116-126
• New complexity bounds for image matching under rotation and scaling
  Christian Hundt, Maciej Liśkiewicz
  Lecture Notes in Computer Science 5577, 2009, pp. 127-141
• Online approximate matching with non-local distances
  Raphaël Clifford, Benjamin Sach
  Lecture Notes in Computer Science 5577, 2009, pp. 142-153
• Faster and space-optimal edit distance ``1'' dictionary
  Djamal Belazzougui
  Lecture Notes in Computer Science 5577, 2009, pp. 154-167
• Approximate matching for run-length encoded strings is 3sum-hard
  Kuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao
  Lecture Notes in Computer Science 5577, 2009, pp. 168-179
• Modeling and algorithmic challenges in online social networks
  Ravi Kumar
  Lecture Notes in Computer Science 5577, 2009, pp. 180-180
• Permuted longest-common-prefix array
  Juha Kärkkäinen, Giovanni Manzini, Simon J. Puglisi
  Lecture Notes in Computer Science 5577, 2009, pp. 181-192
• Periodic string comparison
  Alexander Tiskin
  Lecture Notes in Computer Science 5577, 2009, pp. 193-206
• Deconstructing intractability: A case study for interval constrained coloring
  Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
  Lecture Notes in Computer Science 5577, 2009, pp. 207-220
• Maximum motif problem in vertex-colored graphs
  Riccardo Dondi, Guillaume Fertin, Stéphane Vialette
  Lecture Notes in Computer Science 5577, 2009, pp. 221-235
• Fast RNA structure alignment for crossing input structures
  Rolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann
  Lecture Notes in Computer Science 5577, 2009, pp. 236-248
• Sparse RNA folding: Time and space efficient algorithms
  Rolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson
  Lecture Notes in Computer Science 5577, 2009, pp. 249-262
• Multiple alignment of biological networks: A flexible approach
  Yves-Pol Deniélou, Frédéric Boyer, Alain Viari, Marie-France Sagot
  Lecture Notes in Computer Science 5577, 2009, pp. 263-273
• Graph mining: Patterns, generators and tools
  Christos Faloutsos
  Lecture Notes in Computer Science 5577, 2009, pp. 274-274
• Level-k phylogenetic networks are constructable from a dense triplet set in polynomial time
  Thu-Hien To, Michel Habib
  Lecture Notes in Computer Science 5577, 2009, pp. 275-288