The SCEAS System
Navigation Menu

Journals in DBLP

J. Discrete Algorithms
2005, volume: 3, number: 2-4

  1. Ricardo A. Baeza-Yates, Maxime Crochemore
    Foreword. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:125- [Journal]
  2. Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park
    Constructing suffix arrays in linear time. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:126-142 [Journal]
  3. Pang Ko, Srinivas Aluru
    Space efficient linear time construction of suffix arrays. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:143-156 [Journal]
  4. Gonzalo Navarro, Erkki Sutinen, Jorma Tarhio
    Indexing text with approximate q-grams. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:157-175 [Journal]
  5. Raphaël Clifford
    Distributed suffix trees. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:176-197 [Journal]
  6. Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon, Alejandro Salinger
    Bit-parallel (delta, gamma)-matching and suffix automata. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:198-214 [Journal]
  7. Heikki Hyyrö
    Bit-parallel approximate string matching algorithms with transposition. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:215-229 [Journal]
  8. Nadia Nedjah, Luiza de Macedo Mourelle
    More efficient left-to-right matching for overlapping pattern. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:230-247 [Journal]
  9. Kjell Lemström, Veli Mäkinen
    On minimizing pattern splitting in multi-track string matching. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:248-266 [Journal]
  10. Kjell Lemström, Gonzalo Navarro, Yoan J. Pinzon
    Practical algorithms for transposition-invariant string-matching. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:267-292 [Journal]
  11. Johann Pelfrêne, Saïd Abdeddaïm, Joël Alexandre
    Extracting approximate patterns. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:293-320 [Journal]
  12. Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
    Chaining algorithms for multiple genome comparison. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:321-341 [Journal]
  13. Maria Emilia Telles Walter, Mauro C. Sobrinho, Eugenia T. G. Oliveira, Lorena S. Soares, Adilton G. Oliveira, Thelmo E. S. Martins, Tiago M. Fonseca
    Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:342-361 [Journal]
  14. Olivier Elemento, Olivier Gascuel
    An exact and polynomial distance-based algorithm to reconstruct single copy tandem duplication trees. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:362-374 [Journal]
  15. Behshad Behzadi, Jean-Marc Steyaert
    An improved algorithm for generalized comparison of minisatellites. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:375-389 [Journal]
  16. François Nicolas, Eric Rivals
    Hardness results for the center and median string problems under the weighted and unweighted edit distances. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:390-415 [Journal]
  17. Hiroshi Sakamoto
    A fully linear-time approximation algorithm for grammar-based compression. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:416-430 [Journal]
  18. Gabriel Valiente
    Constrained tree inclusion. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:431-447 [Journal]
  19. Serge Dulucq, Hélène Touzet
    Decomposition algorithms for the tree edit distance problem. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:448-471 [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