Theoretical Computer Science, Volume 325

Volume 325, Number 1, September 2004

• Corrado Priami:
  Prefac. 1-2
  

• Damien Eveillard, Delphine Ropers, Hidde de Jong, Christiane Branlant, Alexander Bockmayr:
  A multi-scale constraint programming model of alternative splicing regulation. 3-24
  
• Nathalie Chabrier-Rivier, Marc Chiaverini, Vincent Danos, François Fages, Vincent Schächter:
  Modeling and querying biomolecular interaction networks. 25-44
  
• Marco Antoniotti, Carla Piazza, Alberto Policriti, Marta Simeoni, Bud Mishra:
  Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice. 45-67
  
• Vincent Danos, Cosimo Laneve:
  Formal molecular biology. 69-110
  
• Michele Curti, Pierpaolo Degano, Corrado Priami, Cosima Tatiana Baldari:
  Modelling biochemical pathways through enhanced pi-calculus. 111-140
  
• Aviv Regev, Ekaterina M. Panina, William Silverman, Luca Cardelli, Ehud Y. Shapiro:
  BioAmbients: an abstraction for biological compartments. 141-167
  

Volume 325, Number 2, October 2004

• Jarkko Kari:
  Preface. 169-
  

• André Barbé, Fritz von Haeseler:
  The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups. 171-214
  
• Tim Boykett:
  Efficient exhaustive listings of reversible one dimensional cellular automata. 215-247
  
• Gianpiero Cattaneo, Alberto Dennunzio, Luciano Margara:
  Solution of some conjectures about topological properties of linear cellular automata. 249-271
  
• Eugen Czeizler:
  On the size of the inverse neighborhoods for one-dimensional reversible cellular automata. 273-284
  
• Andrés Moreira, Nino Boccara, Eric Goles Ch.:
  On conservative and monotone one-dimensional cellular automata and their particle representation. 285-316
  
• Klaus Sutner:
  The complexity of reversible cellular automata. 317-328
  
• Tommaso Toffoli, Silvio Capobianco, Patrizia Mentrasti:
  How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme. 329-344
  

Volume 325, Number 3, October 2004

• Tandy Warnow, Binhai Zhu:
  Preface. 345-346
  

• Mark Marron, Krister M. Swenson, Bernard M. E. Moret:
  Genomic Distances under Deletions and Insertions. 347-360
  
• Zhi-Zhong Chen, Yong Gao, Guohui Lin, Robert Niewiadomski, Yang Wang, Junfeng Wu:
  A space-efficient algorithm for sequence alignment with inversions and reversals. 361-372
  
• Martin Kutz:
  The complexity of Boolean matrix root computation. 373-390
  
• Eric J. Schwabe, Ian M. Sutherland:
  Efficient data mappings for parity-declustered data layouts. 391-407
  
• Francis Y. L. Chin, Xiaotie Deng, Qizhi Fang, Shanfeng Zhu:
  Approximate and dynamic rank aggregation. 409-424
  
• Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama:
  The structure and number of global roundings of a graph. 425-437
  
• Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Hiroki Yanagisawa:
  Randomized approximation of the stable marriage problem. 439-465
  
• Francis Y. L. Chin, Stanley P. Y. Fung:
  Improved competitive algorithms for online scheduling with partial job values. 467-478
  
• Jae-Hoon Kim, Kyung-Yong Chwa:
  Scheduling broadcasts with deadlines. 479-488