Search the dblp DataBase

Publications of Author

1. Joong Chae Na, Raffaele Giancarlo, Kunsoo Park
   O(n²log n) Time On-Line Construction of Two-Dimensional Suffix Trees. [Citation Graph (0, 0)][DBLP]
   COCOON, 2005, pp:273-282 [Conf]
   
2. Joong Chae Na
   Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets. [Citation Graph (0, 0)][DBLP]
   CPM, 2005, pp:57-67 [Conf]
   
3. Joong Chae Na, Kunsoo Park
   Data Compression with Truncated Suffix Trees. [Citation Graph (0, 0)][DBLP]
   Data Compression Conference, 2000, pp:565- [Conf]
   
4. Joong Chae Na, Kunsoo Park
   Simple Implementation of String B-Trees.. [Citation Graph (0, 0)][DBLP]
   SPIRE, 2004, pp:214-215 [Conf]
   
5. Dong Kyue Kim, Joong Chae Na, Ji Eun Kim, Kunsoo Park
   Efficient Implementation of Rank and Select Functions for Succinct Representation. [Citation Graph (0, 0)][DBLP]
   WEA, 2005, pp:315-327 [Conf]
   
6. Joong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park
   Truncated suffix trees and their application to data compression. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2003, v:1, n:304, pp:87-101 [Journal]
   
7. Juha Kärkkäinen, Joong Chae Na
   Faster Filters for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
   ALENEX, 2007, pp:- [Conf]
   
8. 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]
   
9. Joong Chae Na, Raffaele Giancarlo, Kunsoo Park
   On-Line Construction of Two-Dimensional Suffix Trees in O(n² log n) Time. [Citation Graph (0, 0)][DBLP]
   Algorithmica, 2007, v:48, n:2, pp:173-186 [Journal]
   
10. Joong Chae Na, Kunsoo Park
    Alphabet-independent linear-time construction of compressed suffix arrays using o(nlogn)-bit working space. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:385, n:1-3, pp:127-136 [Journal]
    
11. 
    Finding Optimal Alignment and Consensus of Circular Strings. [Citation Graph (, )][DBLP]
    
    
12. 
    Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model. [Citation Graph (, )][DBLP]
    
    
13. 
    On-Line Construction of Parameterized Suffix Trees. [Citation Graph (, )][DBLP]
    
    
14. 
    Consensus Optimizing Both Distance Sum and Radius. [Citation Graph (, )][DBLP]