0022-0000

Journal of Computer and System Sciences (JCSS) - Volume 65, Issue 3 论文列表

本期论文列表
Editorial board

Advertisement #sciencejobs_N

Foreword

Reconstructing an ancestral genome using minimum segments duplications and reversals

The longest common subsequence problem for sequences with nested arc annotations

Combining polynomial running time and fast convergence for the disk-covering method

Methods for reconstructing the history of tandem repeats and their application to the human genome

Steps toward accurate reconstructions of phylogenies from gene-order data

The restriction mapping problem revisited

The consensus string problem and the complexity of comparing hidden Markov models

Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis

Efficient algorithms for multichromosomal genome rearrangements

Papers to Appear

C3 - Advertisement #09111

C4 - TOC