Jeong Seop Sim

From MaRDI portal
Revision as of 17:22, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Jeong Seop Sim to Jeong Seop Sim: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:477703

Available identifiers

zbMath Open sim.jeong-seopMaRDI QIDQ477703

List of research outcomes

PublicationDate of PublicationType
Order-preserving pattern matching with scaling2023-01-30Paper
An \(O(n^2\log m)\)-time algorithm for the boxed-mesh permutation pattern matching problem2018-02-16Paper
On representations of ternary order relations in numeric strings2017-07-17Paper
A space-efficient alphabet-independent Four-Russians' lookup table and a multithreaded Four-Russians' edit distance algorithm2017-02-06Paper
A new graph model and algorithms for consistent superstring problems 2017-01-13Paper
Fast Multiple Order-Preserving Matching Algorithms2016-04-04Paper
A simple proof of optimality for the MIN cache replacement policy2015-12-01Paper
Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem2015-08-20Paper
A fast algorithm for order-preserving pattern matching2014-12-09Paper
Fast Order-Preserving Pattern Matching2013-12-10Paper
Finding consensus and optimal alignment of circular strings2013-02-19Paper
Efficient algorithms for consensus string problems minimizing both distance sum and radius2011-10-10Paper
Linear-time construction of two-dimensional suffix trees2011-03-02Paper
Finding the longest common nonsuperstring in linear time2010-08-20Paper
Improving on-line construction of two-dimensional suffix trees for square matrices2010-08-16Paper
Finding Optimal Alignment and Consensus of Circular Strings2010-07-26Paper
Linear-Time Construction of Suffix Arrays2010-04-06Paper
Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model2009-12-17Paper
A Simple Construction of Two-Dimensional Suffix Trees in Linear Time2008-06-17Paper
https://portal.mardi4nfdi.de/entity/Q54461222008-03-06Paper
The consensus string problem for a metric is NP-complete2007-04-26Paper
Implementing approximate regularities2006-02-16Paper
Constructing suffix arrays in linear time2005-10-27Paper
https://portal.mardi4nfdi.de/entity/Q30248032005-07-04Paper
Approximate periods of strings2002-03-03Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Jeong Seop Sim