The SCEAS System
Navigation Menu

Journals in DBLP

J. Comput. Syst. Sci.
2002, volume: 65, number: 3

  1. Ming Li, Pavel A. Pevzner, Ron Shamir
    Foreword. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:3, pp:441- [Journal]
  2. Nadia El-Mabrouk
    Reconstructing an ancestral genome using minimum segments duplications and reversals. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:3, pp:442-464 [Journal]
  3. Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen
    The longest common subsequence problem for sequences with nested arc annotations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:3, pp:465-480 [Journal]
  4. Jens Lagergren
    Combining polynomial running time and fast convergence for the disk-covering method. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:3, pp:481-493 [Journal]
  5. 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. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:3, pp:494-507 [Journal]
  6. Bernard M. E. Moret, Jijun Tang, Li-San Wang, Tandy Warnow
    Steps toward accurate reconstructions of phylogenies from gene-order data. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:3, pp:508-525 [Journal]
  7. Gopal Pandurangan, Ramesh Hariharan
    The restriction mapping problem revisited. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:3, pp:526-544 [Journal]
  8. Rune B. Lyngsø, Christian N. S. Pedersen
    The consensus string problem and the complexity of comparing hidden Markov models. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:3, pp:545-569 [Journal]
  9. Yaw-Ling Lin, Tao Jiang, Kun-Mao Chao
    Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:3, pp:570-586 [Journal]
  10. Glenn Tesler
    Efficient algorithms for multichromosomal genome rearrangements. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:3, pp:587-609 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002