Abstract is missing.
- Algorithms on Grammar-Compressed StringsGad M. Landau. 1 [doi]
- Automatic Discovery of Patterns in Media ContentNello Cristianini. 2-13 [doi]
- Computational Regulatory GenomicsMartin Vingron. 14 [doi]
- Lempel-Ziv Factorization RevisitedEnno Ohlebusch, Simon Gog. 15-26 [doi]
- Succincter Text Indexing with WildcardsChris Thachuk. 27-40 [doi]
- Self-indexing Based on LZ77Sebastian Kreft, Gonzalo Navarro. 41-54 [doi]
- Filling Scaffolds with Gene Repetitions: Maximizing the Number of AdjacenciesHaitao Jiang, Farong Zhong, Binhai Zhu. 55-64 [doi]
- String Comparison and Lyndon-Like Factorization Using V-Order in Linear TimeDavid E. Daykin, Jacqueline W. Daykin, William F. Smyth. 65-76 [doi]
- A ::::d::::-Step Approach for Distinct Squares in StringsAntoine Deza, Frantisek Franek, Mei Jiang. 77-89 [doi]
- Tractability Results for the Consecutive-Ones Property with MultiplicityCedric Chauve, Ján Manuch, Murray Patterson, Roland Wittler. 90-103 [doi]
- Forest Alignment with Affine Gaps and AnchorsStefanie Schirmer, Robert Giegerich. 104-117 [doi]
- Phylogenetic Footprinting and Consistent Sets of Local AligmentsWolfgang Otto, Peter F. Stadler, Sonja J. Prohaska. 118-131 [doi]
- Unique Perfect Phylogeny Is ::::NP::::-HardMichel Habib, Juraj Stacho. 132-146 [doi]
- Fast Error-Tolerant Quartet Phylogeny AlgorithmsDaniel Gregory Brown, Jakub Truszkowski. 147-161 [doi]
- Real-Time Streaming String-MatchingDany Breslauer, Zvi Galil. 162-172 [doi]
- Simple Real-Time Constant-Space String MatchingDany Breslauer, Roberto Grossi, Filippo Mignosi. 173-183 [doi]
- Space Lower Bounds for Online Pattern MatchingRaphaël Clifford, Markus Jalsenius, Ely Porat, Benjamin Sach. 184-196 [doi]
- Counting Colours in Compressed StringsTravis Gagie, Juha Kärkkäinen. 197-207 [doi]
- On Wavelet Tree ConstructionGerman Tischler. 208-218 [doi]
- Lightweight BWT Construction for Very Large String CollectionsMarkus J. Bauer, Anthony J. Cox, Giovanna Rosone. 219-231 [doi]
- Palindrome Pattern MatchingTomohiro I, Shunsuke Inenaga, Masayuki Takeda. 232-245 [doi]
- Sparse and Truncated Suffix Trees on Variable-Length CodesTakashi Uemura, Hiroki Arimura. 246-260 [doi]
- On the Weak Prefix-Search ProblemPaolo Ferragina. 261-272 [doi]
- Quick Greedy Computation for Minimum Common String PartitionsIsaac Goldstein, Moshe Lewenstein. 273-284 [doi]
- LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed PermutationsJérémy Barbay, Johannes Fischer, Gonzalo Navarro. 285-298 [doi]
- Substring Range ReportingPhilip Bille, Inge Li Gørtz. 299-308 [doi]
- Faster Subsequence and Don t-Care Pattern Matching on Compressed TextsTakanori Yamamoto, Hideo Bannai, Shunsuke Inenaga, Masayuki Takeda. 309-322 [doi]
- A Combinatorial Model of Phyllotaxis Perturbations in ::::Arabidopsis thaliana::::Yassin Refahi, Etienne Farcot, Yann Guédon, Fabrice Besnard, Teva Vernoux, Christophe Godin. 323-335 [doi]
- Tractability and Approximability of Maximal Strip RecoveryLaurent Bulteau, Guillaume Fertin, Minghui Jiang, Irena Rusu. 336-349 [doi]
- Efficient Seeds Computation RevisitedMichalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen. 350-363 [doi]
- Efficient Matching of Biological Sequences Allowing for Non-overlapping InversionsDomenico Cantone, Salvatore Cristofaro, Simone Faro. 364-375 [doi]
- A Coarse-to-Fine Approach to Computing the ::::k::::-Best Viterbi PathsJesper Nielsen. 376-387 [doi]
- Finding Approximate and Constrained Motifs in GraphsRiccardo Dondi, Guillaume Fertin, Stéphane Vialette. 388-401 [doi]
- Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered TreesKouichi Hirata, Yoshiyuki Yamamoto, Tetsuji Kuboyama. 402-415 [doi]
- Approximation Algorithms for Orienting Mixed GraphsMichael Elberfeld, Danny Segev, Colin R. Davidson, Dana Silverbush, Roded Sharan. 416-428 [doi]
- Frequent Submap DiscoveryStéphane Gosselin, Guillaume Damiand, Christine Solnon. 429-440 [doi]
- Edit Distance with Duplications and Contractions RevisitedTamar Pinhas, Dekel Tsur, Shay Zakov, Michal Ziv-Ukelson. 441-454 [doi]
- Polynomial-Time Approximation Algorithms for Weighted LCS ProblemMarek Cygan, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen. 455-466 [doi]
- Restricted Common Superstring and Restricted Common SupersequenceRaphaël Clifford, Zvi Gotthilf, Moshe Lewenstein, Alexandru Popa. 467-478 [doi]