The following pages link to Joong Chae Na (Q294960):
Displayed 28 items.
- FM-index of alignment: a compressed index for similar strings (Q294964) (← links)
- A fast algorithm for order-preserving pattern matching (Q477704) (← links)
- A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm (Q507395) (← links)
- Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
- Efficient algorithms for consensus string problems minimizing both distance sum and radius (Q719265) (← links)
- Improving on-line construction of two-dimensional suffix trees for square matrices (Q987807) (← links)
- Finding the longest common nonsuperstring in linear time (Q989576) (← links)
- Truncated suffix trees and their application to data compression. (Q1401392) (← links)
- An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem (Q1698703) (← links)
- FM-index of alignment with gaps (Q1698723) (← links)
- Finding consensus and optimal alignment of circular strings (Q1935794) (← links)
- On-line construction of parameterized suffix trees for large alphabets (Q1944073) (← links)
- On representations of ternary order relations in numeric strings (Q2363988) (← links)
- On-line construction of two-dimensional suffix trees in \(O(n^{2} \log n)\) time (Q2384787) (← links)
- Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space (Q2456365) (← links)
- Order-preserving pattern matching with scaling (Q2680225) (← links)
- Fast Order-Preserving Pattern Matching (Q2867128) (← links)
- Suffix Tree of Alignment: An Efficient Index for Similar Data (Q2870039) (← links)
- Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem (Q2942252) (← links)
- A new graph model and algorithms for consistent superstring problems <sup /> (Q2955630) (← links)
- A Simple Construction of Two-Dimensional Suffix Trees in Linear Time (Q3506936) (← links)
- Finding Optimal Alignment and Consensus of Circular Strings (Q3575257) (← links)
- Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model (Q3652303) (← links)
- Faster Filters for Approximate String Matching (Q5233494) (← links)
- String Processing and Information Retrieval (Q5393961) (← links)
- Experimental and Efficient Algorithms (Q5710031) (← links)
- Combinatorial Pattern Matching (Q5713569) (← links)
- Computing and Combinatorics (Q5716945) (← links)