Abstract is missing.
- CPM s 20th Anniversary: A Statistical RetrospectiveElena Yavorska Harris, Thierry Lecroq, Gregory Kucherov, Stefano Lonardi. 1-11 [doi]
- Quasi-distinct Parsing and Optimal Compression MethodsAmihood Amir, Yonatan Aumann, Avivit Levy, Yuri Roshko. 12-25 [doi]
- Generalized Substring CompressionOrgad Keller, Tsvi Kopelowitz, Shir Landau, Moshe Lewenstein. 26-38 [doi]
- Text Indexing, Suffix Sorting, and Data Compression: Common Problems and TechniquesRoberto Grossi. 39-40 [doi]
- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data StructureAndrzej Ehrenfeucht, Ross M. McConnell, Sung-Whan Woo. 41-53 [doi]
- Linear Time Suffix Array Construction Using D-Critical SubstringsGe Nong, Sen Zhang, Wai Hong Chan. 54-67 [doi]
- On the Value of Multiple Read/Write Streams for Data CompressionTravis Gagie. 68-77 [doi]
- Reoptimization of the Shortest Common Superstring ProblemDavide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych. 78-91 [doi]
- LCS Approximation via Embedding into Local Non-repetitive StringsGad M. Landau, Avivit Levy, Ilan Newman. 92-105 [doi]
- An Efficient Matching Algorithm for Encoded DNA Sequences and Binary StringsSimone Faro, Thierry Lecroq. 106-115 [doi]
- Fast Searching in Packed StringsPhilip Bille. 116-126 [doi]
- New Complexity Bounds for Image Matching under Rotation and ScalingChristian Hundt, Maciej Liskiewicz. 127-141 [doi]
- Online Approximate Matching with Non-local DistancesRaphaël Clifford, Benjamin Sach. 142-153 [doi]
- Faster and Space-Optimal Edit Distance 1 DictionaryDjamal Belazzougui. 154-167 [doi]
- Approximate Matching for Run-Length Encoded Strings Is 3sum-HardKuan-Yu Chen, Ping-Hui Hsu, Kun-Mao Chao. 168-179 [doi]
- Modeling and Algorithmic Challenges in Online Social NetworksRavi Kumar. 180 [doi]
- Permuted Longest-Common-Prefix ArrayJuha Kärkkäinen, Giovanni Manzini, Simon J. Puglisi. 181-192 [doi]
- Periodic String ComparisonAlexander Tiskin. 193-206 [doi]
- Deconstructing Intractability: A Case Study for Interval Constrained ColoringChristian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann. 207-220 [doi]
- Maximum Motif Problem in Vertex-Colored GraphsRiccardo Dondi, Guillaume Fertin, Stéphane Vialette. 221-235 [doi]
- Fast RNA Structure Alignment for Crossing Input StructuresRolf Backofen, Gad M. Landau, Mathias Möhl, Dekel Tsur, Oren Weimann. 236-248 [doi]
- Sparse RNA Folding: Time and Space Efficient AlgorithmsRolf Backofen, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson. 249-262 [doi]
- Multiple Alignment of Biological Networks: A Flexible ApproachYves-Pol Deniélou, Frédéric Boyer, Alain Viari, Marie-France Sagot. 263-273 [doi]
- Graph Mining: Patterns, Generators and ToolsChristos Faloutsos. 274 [doi]
- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial TimeThu-Hien To, Michel Habib. 275-288 [doi]
- The Structure of Level-k Phylogenetic NetworksPhilippe Gambette, Vincent Berry, Christophe Paul. 289-300 [doi]
- Finding All Sorting Tandem Duplication Random Loss OperationsMatthias Bernt, Ming-Chiang Chen, Daniel Merkle, Hung-Lung Wang, Kun-Mao Chao, Martin Middendorf. 301-313 [doi]
- Average-Case Analysis of Perfect Sorting by ReversalsMathilde Bouvel, Cedric Chauve, Marni Mishna, Dominique Rossin. 314-325 [doi]
- Statistical Properties of Factor OraclesJérémie Bourdon, Irena Rusu. 326-338 [doi]
- Haplotype Inference Constrained by Plausible Haplotype DataMichael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances A. Rosamond, Liat Rozenberg. 339-352 [doi]
- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract)Wei-Bung Wang, Tao Jiang. 353-367 [doi]