Abstract is missing.
- Gene Regulation, Protein Networks and Disease: A Computational PerspectiveRon Shamir. 1 [doi]
- Wavelet Trees for AllGonzalo Navarro. 2-26 [doi]
- The Maximum Number of Squares in a TreeMaxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Wojciech Tyczynski, Tomasz Walen. 27-40 [doi]
- Faster and Simpler Minimal Conflicting Set Identification - (Extended Abstract)Aïda Ouangraoua, Mathieu Raffinot. 41-55 [doi]
- Partitioning into Colorful Components by Minimum Edge DeletionsSharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier, Sven Thiel, Johannes Uhlmann. 56-69 [doi]
- Approximation Algorithms and Hardness Results for Shortest Path Based Graph OrientationsDima Blokh, Danny Segev, Roded Sharan. 70-82 [doi]
- Constant-Time Word-Size String MatchingDany Breslauer, Leszek Gasieniec, Roberto Grossi. 83-96 [doi]
- Pattern Matching in Multiple StreamsRaphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach. 97-109 [doi]
- An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick AutomataOmar AitMous, Frédérique Bassino, Cyril Nicaud. 110-123 [doi]
- Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order InterpolationChristian Hundt, Florian Wendland. 124-137 [doi]
- Hardness of Longest Common Subsequence for Sequences with Bounded Run-LengthsGuillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada, Stéphane Vialette. 138-148 [doi]
- Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a SequenceFerdinando Cicalese, Eduardo Sany Laber, Oren Weimann, Raphael Yuster. 149-158 [doi]
- The Complexity of String PartitioningAnne Condon, Ján Manuch, Chris Thachuk. 159-172 [doi]
- Towards an Optimal Space-and-Query-Time Index for Top-k Document RetrievalWing-Kai Hon, Rahul Shah, Sharma V. Thankachan. 173-184 [doi]
- Document Listing for Queries with Excluded PatternWing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Jeffrey Scott Vitter. 185-195 [doi]
- Cross-Document Pattern MatchingGregory Kucherov, Yakov Nekrich, Tatiana A. Starikovskaya. 196-207 [doi]
- FEMTO: Fast Search of Large Sequence CollectionsMichael P. Ferguson. 208-219 [doi]
- Speeding Up q-Gram Mining on Grammar-Based Compressed TextsKeisuke Goto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. 220-231 [doi]
- Simple and Efficient LZW-Compressed Multiple Pattern MatchingPawel Gawrychowski. 232-242 [doi]
- Computing the Burrows-Wheeler Transform of a String and Its ReverseEnno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda. 243-256 [doi]
- Efficient Algorithm for Circular Burrows-Wheeler TransformWing-Kai Hon, Tsung-Han Ku, Chen-Hua Lu, Rahul Shah, Sharma V. Thankachan. 257-268 [doi]
- Least Random Suffix/Prefix Matches in Output-Sensitive TimeNiko Välimäki. 269-279 [doi]
- Compressed String Dictionary Look-Up with Edit Distance OneDjamal Belazzougui, Rossano Venturini. 280-292 [doi]
- Time-Space Trade-Offs for Longest Common ExtensionsPhilip Bille, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj. 293-305 [doi]
- Local Exact Pattern Matching for Non-fixed RNA StructuresMika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau, Mathias Möhl, Christina Schmiedl, Sebastian Will. 306-320 [doi]
- Impact of the Energy Model on the Complexity of RNA Folding with PseudoknotsSaad Sheikh, Rolf Backofen, Yann Ponty. 321-333 [doi]
- Finding Longest Common Segments in Protein Structures in Nearly Linear TimeYen Kaow Ng, Hirotaka Ono, Ling-ge, Shuai Cheng Li. 334-348 [doi]
- A Linear Kernel for the Complementary Maximal Strip Recovery ProblemHaitao Jiang, Binhai Zhu. 349-359 [doi]
- Efficient Exponential Time Algorithms for Edit Distance between Unordered TreesTatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa, Atsuhiro Takasu. 360-372 [doi]
- Fixed-Parameter Algorithms for Finding Agreement SupertreesDavid Fernández-Baca, Sylvain Guillemot, Brad Shutters, Sudheer Vakati. 373-384 [doi]
- Computing the Rooted Triplet Distance between Galled Trees by Counting TrianglesJesper Jansson, Andrzej Lingas. 385-398 [doi]
- Minimum Leaf Removal for Reconciliation: Complexity and AlgorithmsRiccardo Dondi, Nadia El-Mabrouk. 399-412 [doi]
- On the Closest String via Rank DistanceLiviu Petrisor Dinu, Alexandru Popa. 413-426 [doi]
- On Approximating String Selection Problems with OutliersChristina Boucher, Gad M. Landau, Avivit Levy, David Pritchard, Oren Weimann. 427-438 [doi]
- The Parameterized Complexity of the Shared Center ProblemZhi-Zhong Chen, Lusheng Wang, Wenji Ma. 439-452 [doi]