Journal of Discrete Algorithms, Volume 2

Volume 2, Number 1, March 2004

• Alberto H. F. Laender, Arlindo L. Oliveira:
  Special issue on string processing and information retrieval. 1-2
  
• Gaston H. Gonnet:
  Some string matching problems from Bioinformatics which still need better solutions. 3-15
  
• Dan Suciu:
  From searching text to querying XML streams. 17-32
  
• Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa:
  Compact directed acyclic word graphs for a sliding window. 33-51
  
• Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch:
  Replacing suffix trees with enhanced suffix arrays. 53-86
  
• Gonzalo Navarro:
  Indexing text using the Ziv-Lempel trie. 87-114
  
• Benjamin Bustos, Gonzalo Navarro:
  Probabilistic proximity searching algorithms based on compact partitions. 115-134
  

Volume 2, Number 2, June 2004

• Raffaele Giancarlo, David Sankoff:
  Editorial: Combinatiorial Pattern Matching. 135-136
  
• Ian H. Witten:
  Adaptive text mining: inferring structure from sequences. 137-159
  
• Rolf Backofen:
  A polynomial time upper bound for the number of contacts in the HP-model on the face-centered-cubic lattice (FCC). 161-206
  
• David Liben-Nowell, Jon M. Kleinberg:
  Structural properties and tractability results for linear synteny. 207-228
  
• David Bryant:
  A lower bound for the breakpoint phylogeny problem. 229-255
  
• Tao Jiang, Guohui Lin, Bin Ma, Kaizhong Zhang:
  The longest common subsequence problem for arc-annotated sequences. 257-270
  
• David Fernández-Baca, Timo Seppäläinen, Giora Slutzki:
  Parametric multiple sequence alignment and phylogeny construction. 271-287
  
• Leszek Gasieniec, Jesper Jansson, Andrzej Lingas:
  Approximation algorithms for Hamming clustering problems. 289-301
  
• Sung-Ryul Kim, Kunsoo Park:
  A dynamic edit distance table. 303-312
  
• Steven Skiena, Pavel Sumazin:
  Shift error detection in standardized exams. 313-331
  

Volume 2, Number 3, September 2004

• Sergei Bespamyatnikh, Michael Segal:
  Selecting distances in arrangements of hyperplanes spanned by points. 333-345
  
• Gonzalo Navarro, Mathieu Raffinot:
  Practical and flexible pattern matching over Ziv-Lempel compressed text. 347-371
  
• Prosenjit Bose, Pat Morin, Antoine Vigneron:
  Packing two disks into a polygonal environment. 373-380
  

Volume 2, Number 4, December 2004

• Ulrik Brandes, Dorothea Wagner:
  Foreword: Special Issue of Journal of Discrete Algorithms on the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '2000) held June 15-17, 2000 in Konstanz, Germany. 381
  
• Serafino Cicerone, Gabriele Di Stefano:
  Networks with small stretch number. 383-405
  
• Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth:
  Optimizing cost flows by edge cost and capacity upgrade. 407-423
  
• Stefan Dobrev:
  Computing input multiplicity in anonymous synchronous networks with dynamic faults. 425-438
  
• Ekkehard Köhler:
  Recognizing graphs without asteroidal triples. 439-452
  
• Goran Konjevod, Sven Oliver Krumke, Madhav V. Marathe:
  Budget constrained minimum cost connected medians. 453-469
  
• Andreas Jakoby, Maciej Liskiewicz, Rüdiger Reischuk:
  Approximating schedules for dynamic process graphs efficiently. 471-500
  
• Luca Becchetti, Miriam Di Ianni, Alberto Marchetti-Spaccamela:
  Approximating call-scheduling makespan in all-optical networks. 501-515
  
• Koichi Wada, Wei Chen:
  Optimal fault-tolerant routings with small routing tables for k-connected graphs. 517-530
  

Last update Fri May 17 20:27:07 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page