| 441 | -- | 0 | Ming Li, Pavel A. Pevzner, Ron Shamir. Foreword |
| 442 | -- | 464 | Nadia El-Mabrouk. Reconstructing an ancestral genome using minimum segments duplications and reversals |
| 465 | -- | 480 | Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen. The longest common subsequence problem for sequences with nested arc annotations |
| 481 | -- | 493 | Jens Lagergren. Combining polynomial running time and fast convergence for the disk-covering method |
| 494 | -- | 507 | Deep Jaitly, Paul E. Kearney, Guo-Hui Lin, Bin Ma. Methods for reconstructing the history of tandem repeats and their application to the human genome |
| 508 | -- | 525 | Bernard M. E. Moret, Jijun Tang, Li-San Wang, Tandy Warnow. Steps toward accurate reconstructions of phylogenies from gene-order data |
| 526 | -- | 544 | Gopal Pandurangan, Ramesh Hariharan. The restriction mapping problem revisited |
| 545 | -- | 569 | Rune B. Lyngsø, Christian N. S. Pedersen. The consensus string problem and the complexity of comparing hidden Markov models |
| 570 | -- | 586 | Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao. Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis |
| 587 | -- | 609 | Glenn Tesler. Efficient algorithms for multichromosomal genome rearrangements |