Joong Chae Na

According to our database1, Joong Chae Na authored at least 41 papers between 2000 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
A Simple Heuristic for Order-Preserving Matching.
IEICE Transactions, 2019

Fast single individual haplotyping method using GPGPU.
Comp. in Bio. and Med., 2019

2018
FM-index of alignment with gaps.
Theor. Comput. Sci., 2018

An O(n2log⁡m)-time algorithm for the boxed-mesh permutation pattern matching problem.
Theor. Comput. Sci., 2018

PEATH: single-individual haplotyping by a probabilistic evolutionary algorithm with toggling.
Bioinformatics, 2018

2017
On Representations of Ternary Order Relations in Numeric Strings.
Mathematics in Computer Science, 2017

2016
Indexed Two-Dimensional String Matching.
Encyclopedia of Algorithms, 2016

FM-index of alignment: A compressed index for similar strings.
Theor. Comput. Sci., 2016

A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm.
Theor. Comput. Sci., 2016

2015
A fast algorithm for order-preserving pattern matching.
Inf. Process. Lett., 2015

Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Generation of an arbitrary shaped large maze by assembling mazes.
Proceedings of the 2015 IEEE Conference on Computational Intelligence and Games, 2015

2013
Finding consensus and optimal alignment of circular strings.
Theor. Comput. Sci., 2013

Suffix Array of Alignment: A Practical Index for Similar Data.
Proceedings of the String Processing and Information Retrieval, 2013

Suffix Tree of Alignment: An Efficient Index for Similar Data.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

Fast Order-Preserving Pattern Matching.
Proceedings of the Combinatorial Optimization and Applications, 2013

2012
Generalization of TORCS car racing controllers with artificial neural networks and linear regression analysis.
Neurocomputing, 2012

2011
Efficient algorithms for consensus string problems minimizing both distance sum and radius.
Theor. Comput. Sci., 2011

On-line construction of parameterized suffix trees for large alphabets.
Inf. Process. Lett., 2011

Linear-Time Construction of Two-Dimensional Suffix Trees.
Algorithmica, 2011

Exploration of CPU/GPU co-execution: from the perspective of performance, energy, and temperature.
Proceedings of the Research in Applied Computation Symposium, 2011

2010
Finding Optimal Alignment and Consensus of Circular Strings.
Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009
Improving Lookup Time Complexity of Compressed Suffix Arrays using Multi-ary Wavelet Tree.
JCSE, 2009

Improving on-line construction of two-dimensional suffix trees for square matrices.
Inf. Process. Lett., 2009

Finding the longest common nonsuperstring in linear time.
Inf. Process. Lett., 2009

Alignment of biological sequences with quality scores.
IJBRA, 2009

Fast Computation of Rank and Select Functions for Succinct Representation.
IEICE Transactions, 2009

On-Line Construction of Parameterized Suffix Trees.
Proceedings of the String Processing and Information Retrieval, 2009

Consensus Optimizing Both Distance Sum and Radius.
Proceedings of the String Processing and Information Retrieval, 2009

Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
Two-Dimensional Pattern Indexing.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

2007
Alphabet-independent linear-time construction of compressed suffix arrays using o(nlogn)-bit working space.
Theor. Comput. Sci., 2007

On-Line Construction of Two-Dimensional Suffix Trees in O(n2 log n) Time.
Algorithmica, 2007

A Simple Construction of Two-Dimensional Suffix Trees in Linear Time.
Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

Faster Filters for Approximate String Matching.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2005
Efficient Implementation of Rank and Select Functions for Succinct Representation.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

O(n2log n) Time On-Line Construction of Two-Dimensional Suffix Trees.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Simple Implementation of String B-Trees..
Proceedings of the String Processing and Information Retrieval, 2004

2003
Truncated suffix trees and their application to data compression.
Theor. Comput. Sci., 2003

2000
Data Compression with Truncated Suffix Trees.
Proceedings of the Data Compression Conference, 2000


  Loading...