Jeong Seop Sim

Orcid: 0000-0002-6609-8384

According to our database1, Jeong Seop Sim authored at least 30 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Order-preserving pattern matching with scaling.
Inf. Process. Lett., 2023

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

2017
On Representations of Ternary Order Relations in Numeric Strings.
Math. Comput. Sci., 2017

A power- and storage-efficient HLS media server for multi-bitrate VOD services.
Proceedings of the 2017 IEEE International Conference on Big Data and Smart Computing, 2017

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

A simple proof of optimality for the MIN cache replacement policy.
Inf. Process. Lett., 2016

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

Fast Multiple Order-Preserving Matching Algorithms.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

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

2014
Balancing disk energy against reliability in video playback.
Multim. Syst., 2014

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

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

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

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

2010
Reducing disk power consumption in portable media players.
Proceedings of the 8th IEEE Workshop on Embedded Systems for Real-Time Multimedia, 2010

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

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

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

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

2006
Transcription Factor Binding Sites Prediction Based on Sequence Similarity.
Proceedings of the Fuzzy Systems and Knowledge Discovery, Third International Conference, 2006

2005
Implementing approximate regularities.
Math. Comput. Model., 2005

Constructing suffix arrays in linear time.
J. Discrete Algorithms, 2005

Approximate Seeds of Strings.
J. Autom. Lang. Comb., 2005

Protein Structure Abstractionand Automatic Clustering Using Secondary Structure Element Sequences.
Proceedings of the Computational Science and Its Applications, 2005

Time and Space Efficient Search for Small Alphabets with Suffix Arrays.
Proceedings of the Fuzzy Systems and Knowledge Discovery, Second International Conference, 2005

2003
The consensus string problem for a metric is NP-complete.
J. Discrete Algorithms, 2003

Linear-Time Construction of Suffix Arrays.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2001
Approximate periods of strings.
Theor. Comput. Sci., 2001


  Loading...