# Joong Chae Na

According to our database

Collaborative distances:

^{1}, Joong Chae Na authored at least 43 papers between 2000 and 2023.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### On csauthors.net:

## Bibliography

2023

Inf. Syst., October, 2023

Inf. Process. Lett., 2023

2019

IEICE Trans. Inf. Syst., 2019

Comput. Biol. Medicine, 2019

2018

Theor. Comput. Sci., 2018

An O(n2logm)-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.

Bioinform., 2018

2017

Math. Comput. Sci., 2017

2016

Encyclopedia of Algorithms, 2016

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

Inf. Process. Lett., 2015

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Proceedings of the 2015 IEEE Conference on Computational Intelligence and Games, 2015

2013

Theor. Comput. Sci., 2013

Proceedings of the String Processing and Information Retrieval, 2013

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

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

Inf. Process. Lett., 2011

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

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

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

J. Comput. Sci. Eng., 2009

Improving on-line construction of two-dimensional suffix trees for square matrices.

Inf. Process. Lett., 2009

Inf. Process. Lett., 2009

Int. J. Bioinform. Res. Appl., 2009

IEICE Trans. Inf. Syst., 2009

Proceedings of the String Processing and Information Retrieval, 2009

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

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(n<sup>2</sup> log n) Time.

Algorithmica, 2007

Proceedings of the Combinatorial Pattern Matching, 18th Annual Symposium, 2007

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

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Proceedings of the String Processing and Information Retrieval, 2004

2003

Theor. Comput. Sci., 2003

2000

Proceedings of the Data Compression Conference, 2000