Joong Chae Na

Available identifiers

zbMath Open na.joong-chaeMaRDI QIDQ294960

List of research outcomes

Publication	Date of Publication	Type
Order-preserving pattern matching with scaling	2023-01-30	Paper
Faster Filters for Approximate String Matching	2019-09-11	Paper
An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem	2018-02-16	Paper
FM-index of alignment with gaps	2018-02-16	Paper
On representations of ternary order relations in numeric strings	2017-07-17	Paper
A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm	2017-02-06	Paper
A new graph model and algorithms for consistent superstring problems	2017-01-13	Paper
FM-index of alignment: a compressed index for similar strings	2016-06-16	Paper
Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem	2015-08-20	Paper
A fast algorithm for order-preserving pattern matching	2014-12-09	Paper
Suffix Tree of Alignment: An Efficient Index for Similar Data	2014-01-17	Paper
Fast Order-Preserving Pattern Matching	2013-12-10	Paper
On-line construction of parameterized suffix trees for large alphabets	2013-04-04	Paper
Finding consensus and optimal alignment of circular strings	2013-02-19	Paper
Efficient algorithms for consensus string problems minimizing both distance sum and radius	2011-10-10	Paper
Linear-time construction of two-dimensional suffix trees	2011-03-02	Paper
Finding the longest common nonsuperstring in linear time	2010-08-20	Paper
Improving on-line construction of two-dimensional suffix trees for square matrices	2010-08-16	Paper
Finding Optimal Alignment and Consensus of Circular Strings	2010-07-26	Paper
Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model	2009-12-17	Paper
A Simple Construction of Two-Dimensional Suffix Trees in Linear Time	2008-06-17	Paper
Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space	2007-10-18	Paper
On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time	2007-10-10	Paper
String Processing and Information Retrieval	2006-10-24	Paper
Computing and Combinatorics	2006-01-11	Paper
Combinatorial Pattern Matching	2005-12-14	Paper
Experimental and Efficient Algorithms	2005-11-30	Paper
Truncated suffix trees and their application to data compression.	2003-08-17	Paper

Research outcomes over time

This page was built for person: Joong Chae Na