1. Foreword

   • Ying Xu
   • Saturo Miyano
   • Tom Head

   OriginalPaper Pages: 147 - 148

2. On the Tightness of the Alternating-Cycle Lower Bound for Sorting by Reversals

   • Alberto Caprara

   OriginalPaper Pages: 149 - 182

3. On the Complexity of Constructing Evolutionary Trees

   • Leszek Gasieniec
   • Jesper Jansson
   • Anna Östlin

   OriginalPaper Pages: 183 - 197

4. Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices

   • Bang Ye Wu
   • Kun-Mao Chao
   • Chuan Yi Tang

   OriginalPaper Pages: 199 - 211

5. Fitting Distances by Tree Metrics with Increment Error

   • Bin Ma
   • Lusheng Wang
   • Louxin Zhang

   OriginalPaper Pages: 213 - 225

6. Aligning DNA Sequences to Minimize the Change in Protein

   • Yufang Hua
   • Tao Jiang
   • Bin Wu

   OriginalPaper Pages: 227 - 245

7. An Approximation Algorithm for Alignment of Multiple Sequences using Motif Discovery

   • Laxmi Parida
   • Aris Floratos
   • Isidore Rigoutsos

   OriginalPaper Pages: 247 - 275

8. Horn Clause Computation with DNA Molecules

   • Satoshi Kobayashi

   OriginalPaper Pages: 277 - 299

9. Combinatorial Optimization in Rapidly Mutating Drug-Resistant Viruses

   • Richard H. Lathrop
   • Michael J. Pazzani

   OriginalPaper Pages: 301 - 320

10. Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-free Languages

    • Tatsuya Akutsu

    OriginalPaper Pages: 321 - 336