Theoretical Computer Science, Volume 335

Volume 335, Number 1, May 2005

• Alberto Apostolico, Raffaele Giancarlo:
  Foreword: Pattern Discovery in the Post Genome. 1-2
  
• Abhijit Chattaraj, Laxmi Parida:
  An inexact-suffix-tree-based algorithm for detecting extensible patterns. 3-14
  
• Lusheng Wang, Hao Zhao, Guozhu Dong, Jianping Li:
  On the complexity of finding emerging patterns. 15-27
  
• Giancarlo Mauri, Giulio Pavesi:
  Algorithms for pattern matching and discovery in RNA secondary structure. 29-51
  
• Ying Xu, Lusheng Wang, Hao Zhao, Jianping Li:
  Exact matching of RNA secondary structure patterns. 53-66
  
• Jérôme Waldispühl, Jean-Marc Steyaert:
  Modeling and predicting all-alpha transmembrane proteins including helix-helix pairing. 67-92
  
• Charles Choy, Jesper Jansson, Kunihiko Sadakane, Wing-Kin Sung:
  Computing the maximum agreement of phylogenetic networks. 93-107
  
• Vineet Bafna, Sorin Istrail, Giuseppe Lancia, Romeo Rizzi:
  Polynomial and APX-hard cases of the individual haplotyping problem. 109-125
  

Volume 335, Number 2-3, May 2005

• Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir, Zoltán Ésik:
  Guest editors' foreword: Process Algebra. 127-129
  
• Jos C. M. Baeten:
  A brief history of process algebra. 131-146
  
• Bas Luttik, Vincent van Oostrom:
  Decomposition orders another generalisation of the fundamental theorem of arithmetic. 147-186
  
• Flavio Corradini, Walter Vogler:
  Measuring the performance of asynchronous systems with PAFAS. 187-213
  
• Jan A. Bergstra, C. A. Middelburg:
  Process algebra for hybrid systems. 215-280
  
• Alessandro Aldini, Marco Bernardo:
  On the usability of process algebra: An architectural view. 281-329
  
• Roberto Bruni, Ugo Montanari, Vladimiro Sassone:
  Observational congruences for dynamically reconfigurable tile systems. 331-372
  
• Catuscia Palamidessi, Oltea Mihaela Herescu:
  A randomized encoding of the Pi-calculus with mixed choice. 373-404