Journals in DBLP
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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ] 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 ]