The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jeong Seop Sim: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dong Kyue Kim, Jeong Seop Sim, Heejin Park, Kunsoo Park
    Linear-Time Construction of Suffix Arrays. [Citation Graph (0, 0)][DBLP]
    CPM, 2003, pp:186-199 [Conf]
  2. Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth
    Approximate Periods of Strings. [Citation Graph (0, 0)][DBLP]
    CPM, 1999, pp:123-133 [Conf]
  3. Jeong Seop Sim
    Time and Space Efficient Search for Small Alphabets with Suffix Arrays. [Citation Graph (0, 0)][DBLP]
    FSKD (1), 2005, pp:1102-1107 [Conf]
  4. Jeong Seop Sim, Soo-Jun Park
    Transcription Factor Binding Sites Prediction Based on Sequence Similarity. [Citation Graph (0, 0)][DBLP]
    FSKD, 2006, pp:1058-1061 [Conf]
  5. Sung-Hee Park, Chan Yong Park, Dae-Hee Kim, Seon Hee Park, Jeong Seop Sim
    Protein Structure Abstractionand Automatic Clustering Using Secondary Structure Element Sequences. [Citation Graph (0, 0)][DBLP]
    ICCSA (2), 2005, pp:1284-1292 [Conf]
  6. Jeong Seop Sim, Kunsoo Park
    The consensus string problem for a metric is NP-complete. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:1, pp:111-117 [Journal]
  7. 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]
  8. Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth
    Approximate periods of strings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:557-568 [Journal]
  9. Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park
    A Simple Construction of Two-Dimensional Suffix Trees in Linear Time. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:352-364 [Conf]

  10. Finding Optimal Alignment and Consensus of Circular Strings. [Citation Graph (, )][DBLP]


  11. Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model. [Citation Graph (, )][DBLP]


  12. Consensus Optimizing Both Distance Sum and Radius. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.005secs
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